Wiki
Clone wikiRogueSharp / RogueSharp.Algorithms / DirectedEdge / README
DirectedEdge Class
The DirectedEdge class represents a weighted edge in an edge-weighted directed graph.
Inheritance Hierarchy
SystemObject
RogueSharp.AlgorithmsDirectedEdge
Namespace: RogueSharp.Algorithms
Assembly:
Syntax
publicclassDirectedEdge
The DirectedEdge type exposes the following members.
Constructors
Name | Description |
---|---|
DirectedEdge | Constructs a directed edge from one specified vertex to another with the given weight |
Properties
Name | Description |
---|---|
From | Returns the destination vertex of the DirectedEdge |
To | Returns the start vertex of the DirectedEdge |
Weight | Returns the weight of the DirectedEdge |
Methods
Name | Description |
---|---|
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.) |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
ToString | Returns a string that represents the current DirectedEdge (Overrides ObjectToString.) |
See Also
Reference
RogueSharp.Algorithms Namespace
Other Resources
DirectedEdge class from Princeton University's Java Algorithms
[8]: 2014-2016 Faron Bracy
Updated