basic graph algorithm using java (1.8+).
Using Graph class. Provided methods for detecting Vertexes connections. Using CC class to split connections components.
Using Digraph class. Provided methods for detecting Vertexes connections. Strongly connections components using KosarajuSCC. Topological using Topological class.
Using EdgeWeightedGraph and Edge to calculate minimum spanning tree. Provided LazyPrimMST and PrimMST class for the purpose.
Using EdgeWeightedDigraph and DirectedEdge to calculate the Shortest path. Provided DijkstraSP class for the purpose.