Use Java to finish the Computer Network Analysis with Dijkstra's Algorithms.
Practice all knowledge related to Java such as interface, abstract class, JavaDoc, .jar file, how to clean code, optimize your algorithms.
The program needs to calculate the number of edges, vertices, check the connectivity, the diameter of a graph.
Also calculate the shortest path between any 2 vertices and the betweenness centrality measure of each vertex.
The documentation must be written using JavaDoc.
Skill gained: OOP in Java, clean code, JavaDoc