Wiki
Clone wikiRogueSharp / RogueSharp.Algorithms / DijkstraShortestPath / README
DijkstraShortestPath Class
The DijkstraShortestPath class represents a data type for solving the single-source shortest paths problem in edge-weighted digraphs where the edge weights are non-negative
Inheritance Hierarchy
SystemObject
RogueSharp.AlgorithmsDijkstraShortestPath
Namespace: RogueSharp.Algorithms
Assembly:
Syntax
publicclassDijkstraShortestPath
The DijkstraShortestPath type exposes the following members.
Constructors
| Name | Description |
|---|---|
| DijkstraShortestPath | Computes a shortest paths tree from the specified sourceVertex to every other vertex in the edge-weighted directed graph |
Methods
| Name | Description |
|---|---|
| Check | check optimality conditions: |
| DistanceTo | Returns the length of a shortest path from the sourceVertex to the specified destinationVertex |
| 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 it is reclaimed by garbage collection. (Inherited from Object.) |
| GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) |
| GetType | Gets the Type of the current instance. (Inherited from Object.) |
| HasPathTo | Is there a path from the sourceVertex to the specified destinationVertex? |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
| PathTo | Returns an IEnumerable of DirectedEdges representing a shortest path from the sourceVertex to the specified destinationVertex |
| ToString | Returns a string that represents the current object. (Inherited from Object.) |
See Also
Reference
RogueSharp.Algorithms Namespace
Other Resources
DijkstraSP class from Princeton University's Java Algorithms
[8]: 2014-2016 Faron Bracy
Updated