The ShortestPaths type exposes the following members.

Methods

  NameDescription
Public methodStatic memberAcyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][])
This method solves the single-source shortest path problem for acyclic directed graphs.
Public methodStatic memberAcyclic(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.
Public methodStatic memberAcyclic(Graph, Node, IDataProvider, INodeMap, INodeMap)
Like Acyclic(Graph, Node, array<Double>[]()[][], array<Double>[]()[][], array<Edge>[]()[][]) but uses NodeMaps and DataProviders instead of arrays.
Public methodStatic memberAllPairs
This method solves the all-pairs shortest path problem for graphs with arbitrary edge costs.
Public methodStatic memberBellmanFord(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
This method solves the single-source shortest path problem for arbitrary graphs.
Public methodStatic memberBellmanFord(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.
Public methodStatic memberBellmanFord(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap)
Public methodStatic memberConstructEdgePath(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.
Public methodStatic memberConstructEdgePath(Node, Node, IDataProvider)
Like ConstructEdgePath(Node, Node, array<Edge>[]()[][]) with the difference that the path edges are given by a DataProvider.
Public methodStatic memberConstructNodePath(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.
Public methodStatic memberConstructNodePath(Node, Node, IDataProvider)
Like ConstructNodePath(Node, Node, array<Edge>[]()[][]) with the difference that the path edges are given by a DataProvider.
Public methodStatic memberDijkstra(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
This method solves the single-source shortest path problem for arbitrary graphs.
Public methodStatic memberDijkstra(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.
Public methodStatic memberDijkstra(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap)
Public methodEquals
Determines whether the specified Object is equal to the current Object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.
(Inherited from Object.)
Public methodStatic memberFindShortestUniformPaths(Graph, Node, Node, Boolean, IEdgeMap)
Marks all edges that belong to a shortest path from start to end node.
Public methodStatic memberFindShortestUniformPaths(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.
Public methodGetHashCode
Serves as a hash function for a particular type.
(Inherited from Object.)
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Public methodStatic memberKShortestPaths
This method finds the k shortest paths connecting a pair of nodes in a directed graph with non-negative edge costs.
Public methodStatic memberKShortestPathsCursor
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.
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodStatic memberShortestPair
Returns two edge-disjoint paths from in a nonnegatively-weighted directed graph, so that both paths connect s and t and have minimum total length.
Public methodStatic memberSingleSource(Graph, Node, Boolean, array<Double>[]()[][], array<Double>[]()[][])
This method solves the single-source shortest path problem for arbitrary graphs.
Public methodStatic memberSingleSource(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.
Public methodStatic memberSingleSource(Graph, Node, Boolean, IDataProvider, INodeMap, INodeMap)
Public methodStatic memberSingleSourceSingleSink(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.
Public methodStatic memberSingleSourceSingleSink(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.
Public methodStatic memberSingleSourceSingleSink(Graph, Node, Node, Boolean, array<Double>[]()[][], array<Edge>[]()[][])
This method solves the single-source single-sink shortest path problem for arbitrary graphs.
Public methodStatic memberSingleSourceSingleSink(Graph, Node, Node, Boolean, IDataProvider, INodeMap)
Public methodToString
Returns a string that represents the current object.
(Inherited from Object.)
Public methodStatic memberUniform(Graph, Node, Boolean, array<Double>[]()[][])
This method solves the single-source shortest path problem for arbitrary graphs where each edge has a uniform cost of 1.0.
Public methodStatic memberUniform(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.
Public methodStatic memberUniform(Graph, Node, Boolean, INodeMap, INodeMap)
Public methodStatic memberUniformCost
Convenience method that returns an array containing uniform edge costs of 1.0 for each edge of the given graph.

See Also