Package dev.nm.graph.algorithm.shortestpath

Interface Summary

Interface	Description
ShortestPath<V>	In graph theory, a shortest path algorithm finds a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.

Class Summary

Class	Description
Dijkstra<V>	Dijkstra's algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree.