Uses of Interface
net.automatalib.util.graph.apsp.APSPResult
-
Packages that use APSPResult Package Description net.automatalib.util.graph net.automatalib.util.graph.apsp -
-
Uses of APSPResult in net.automatalib.util.graph
Methods in net.automatalib.util.graph that return APSPResult Modifier and Type Method Description static <N,E>
APSPResult<N,E>Graphs. findAPSP(Graph<N,E> graph, EdgeWeights<E> edgeWeights)
Computes the shortest paths between all pairs of nodes in a graph, using the Floyd-Warshall dynamic programming algorithm. -
Uses of APSPResult in net.automatalib.util.graph.apsp
Classes in net.automatalib.util.graph.apsp that implement APSPResult Modifier and Type Class Description class
FloydWarshallAPSP<N,E>
Implementation of the Floyd-Warshall dynamic programming algorithm for the all pairs shortest paths problem.Methods in net.automatalib.util.graph.apsp that return APSPResult Modifier and Type Method Description static <N,E>
APSPResult<N,E>FloydWarshallAPSP. findAPSP(Graph<N,E> graph, EdgeWeights<E> edgeWeights)
-