Package | Description |
---|---|
net.automatalib.algorithms.graph | |
net.automatalib.algorithms.graph.sssp |
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.
|
Modifier and Type | Class and Description |
---|---|
class |
DijkstraSSSP<N,E>
Implementation of Dijkstras algorithm for the single-source shortest path
problem.
|
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.
|
Copyright © 2015. All Rights Reserved.