Wiki
Clone wikiRogueSharp / RogueSharp.Algorithms / Graph / README
Graph Class
The Graph class represents an undirected graph of vertices named 0 through V - 1.
Inheritance Hierarchy
SystemObject
RogueSharp.AlgorithmsGraph
Namespace: RogueSharp.Algorithms
Assembly:
Syntax
publicclassGraph
The Graph type exposes the following members.
Constructors
Name | Description |
---|---|
Graph | Constructs a new Graph containing the specified number of vertices and 0 edges |
Properties
Name | Description |
---|---|
NumberOfEdges | The number of edges in the Graph |
NumberOfVertices | The number of vertices in the Graph |
Methods
Name | Description |
---|---|
AddEdge | Adds the undirected edge vertexSource-vertexDestination to the Graph |
Adjacent | Gets an IEnumerable of the vertices adjacent to the specified vertex |
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 this Graph (Overrides ObjectToString.) |
See Also
Reference
RogueSharp.Algorithms Namespace
Other Resources
Graph class from Princeton University's Java Algorithms
[9]: 2014-2016 Faron Bracy
Updated