The ShortestPaths type exposes the following members.
Methods
Name  Description  

Acyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][])  This method solves the singlesource shortest path problem for acyclic directed graphs.  
Acyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][]) 
Like
Acyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][])
but additionally this method
yields the path edges of each calculated shortest path.
 
Acyclic(Graph, Node, IDataProvider, INodeMap, INodeMap) 
Like
Acyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps and DataProviders instead of arrays.
 
AllPairs 
This method solves the allpairs shortest path problem for graphs with arbitrary
edge costs.
 
BellmanFord(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])  This method solves the singlesource shortest path problem for arbitrary graphs.  
BellmanFord(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][]) 
Like
BellmanFord(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
but additionally this method
yields the path edges of each calculated shortest path.
 
BellmanFord(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap) 
Like
BellmanFord(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps and DataProviders instead of arrays.
 
ConstructEdgePath(Node, Node, array<Edge>[]()[][]) 
Convenience method that constructs an explicit edge path from the
result yielded by one of the shortest paths methods defined in this class.
 
ConstructEdgePath(Node, Node, IDataProvider) 
Like
ConstructEdgePath(Node, Node, array<Edge>[]()[][])
with the difference that
the path edges are given by a DataProvider.
 
ConstructNodePath(Node, Node, array<Edge>[]()[][]) 
Convenience method that constructs an explicit node path from the
result yielded by one of the shortest paths methods defined in this class.
 
ConstructNodePath(Node, Node, IDataProvider) 
Like
ConstructNodePath(Node, Node, array<Edge>[]()[][])
with the difference that
the path edges are given by a DataProvider.
 
Dijkstra(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])  This method solves the singlesource shortest path problem for arbitrary graphs.  
Dijkstra(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][]) 
Like
Dijkstra(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
but additionally this method
yields the path edges of each calculated shortest path.
 
Dijkstra(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap) 
Like
Dijkstra(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps and DataProviders instead of arrays.
 
Equals  Determines whether the specified Object is equal to the current Object. (Inherited from Object.)  
Finalize  Allows an object to try to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. (Inherited from Object.)  
FindShortestUniformPaths(Graph, Node, Node, Boolean, IEdgeMap)  Marks all edges that belong to a shortest path from start to end node.  
FindShortestUniformPaths(Graph, Node, IDataProvider, Boolean, Int32, EdgeList, NodeList) 
Finds all nodes and edges that belong to a shortest path from start to a set of target nodes in the graph not
farther away than a given distance.
 
GetHashCode  Serves as a hash function for a particular type. (Inherited from Object.)  
GetType  Gets the Type of the current instance. (Inherited from Object.)  
KShortestPaths 
This method finds the k shortest paths
connecting a pair of nodes in a directed graph with nonnegative edge costs.
 
KShortestPathsCursor 
A variant of
KShortestPaths(Graph, IDataProvider, Node, Node, Int32)
that returns its result not as a list but as a special cursor that calculates
the next path in the sequence only when needed.
 
MemberwiseClone  Creates a shallow copy of the current Object. (Inherited from Object.)  
ShortestPair 
Returns two edgedisjoint paths from in a nonnegativelyweighted directed graph, so that both paths connect
s and t and have minimum total length.
 
SingleSource(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])  This method solves the singlesource shortest path problem for arbitrary graphs.  
SingleSource(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][]) 
Like
SingleSource(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
but additionally this method
yields the path edges of each calculated shortest path.
 
SingleSource(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap) 
Like
SingleSource(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps and DataProviders instead of arrays.
 
SingleSourceSingleSink(Graph, Node, Node, Boolean, array<Double>[]()[][]) 
Similar to
SingleSourceSingleSink(Graph, Node, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][])
but instead of returning the shortest distance between the source and sink
the actual shortest edge path between these nodes will be returned.
 
SingleSourceSingleSink(Graph, Node, Node, Boolean, IDataProvider) 
Similar to
SingleSourceSingleSink(Graph, Node, Node, Boolean, IDataProvider, INodeMap)
but instead of returning the shortest distance between the source and sink
the actual shortest edge path between these nodes will be returned.
 
SingleSourceSingleSink(Graph, Node, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][]) 
This method solves the singlesource singlesink shortest path problem
for arbitrary graphs.
 
SingleSourceSingleSink(Graph, Node, Node, Boolean, IDataProvider, INodeMap) 
Like
SingleSourceSingleSink(Graph, Node, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps and DataProviders instead of arrays.
 
ToString  Returns a string that represents the current object. (Inherited from Object.)  
Uniform(Graph, Node, Boolean, array<Double>[]()[][]) 
This method solves the singlesource shortest path problem for arbitrary graphs
where each edge has a uniform cost of 1.0.
 
Uniform(Graph, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][]) 
Like
Uniform(Graph, Node, Boolean, array<Double>[]()[][])
but additionally this method
yields the path edges of each calculated shortest path.
 
Uniform(Graph, Node, Boolean, INodeMap, INodeMap) 
Like
Uniform(Graph, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][])
but uses NodeMaps instead of
arrays.
 
UniformCost 
Convenience method that returns an array containing
uniform edge costs of 1.0 for each edge
of the given graph.
