Uses of Interface
net.automatalib.util.graph.sssp.SSSPResult
-
Packages that use SSSPResult Package Description net.automatalib.util.graph net.automatalib.util.graph.sssp -
-
Uses of SSSPResult in net.automatalib.util.graph
Methods in net.automatalib.util.graph that return SSSPResult Modifier and Type Method Description static <N,E>
SSSPResult<N,E>Graphs. findSSSP(Graph<N,E> graph, N init, EdgeWeights<E> edgeWeights)
Computes the shortest paths between a single source node and all other nodes in a graph, using Dijkstra's algorithm. -
Uses of SSSPResult in net.automatalib.util.graph.sssp
Classes in net.automatalib.util.graph.sssp that implement SSSPResult Modifier and Type Class Description class
DijkstraSSSP<N,E>
Implementation of Dijkstras algorithm for the single-source shortest path problem.Methods in net.automatalib.util.graph.sssp that return SSSPResult Modifier and Type Method Description static <N,E>
SSSPResult<N,E>DijkstraSSSP. findSSSP(Graph<N,E> graph, N init, EdgeWeights<E> edgeWeights)
Search for the shortest paths from a single source node in a graph.
-