Uses of Interface
net.automatalib.algorithms.graph.sssp.SSSPResult

Packages that use SSSPResult

Package	Description
net.automatalib.algorithms.graph
net.automatalib.algorithms.graph.sssp

Uses of SSSPResult in net.automatalib.algorithms.graph

Methods in net.automatalib.algorithms.graph that return SSSPResult

Modifier and Type	Method and Description
static <N,E> SSSPResult<N,E>	GraphAlgorithms.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.algorithms.graph.sssp

Classes in net.automatalib.algorithms.graph.sssp that implement SSSPResult

Modifier and Type	Class and Description
class	DijkstraSSSP<N,E> Implementation of Dijkstras algorithm for the single-source shortest path problem.

Methods in net.automatalib.algorithms.graph.sssp that return SSSPResult

Modifier and Type	Method and 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.