Wiki

Clone wiki

RogueSharp / RogueSharp.Algorithms / EdgeWeightedDigraph / README

EdgeWeightedDigraph Class

The EdgeWeightedDigrpah class represents an edge-weighted directed graph of vertices named 0 through V-1, where each directed edge is of type DirectedEdge and has real-valued weight.

Inheritance Hierarchy

SystemObject
RogueSharp.AlgorithmsEdgeWeightedDigraph

Namespace: RogueSharp.Algorithms
Assembly:

Syntax

publicclassEdgeWeightedDigraph

The EdgeWeightedDigraph type exposes the following members.

Constructors

Name Description
EdgeWeightedDigraph Constructs an empty edge-weighted digraph with the specified number of vertices and 0 edges

Properties

Name Description
NumberOfEdges The number of edges in the edge-weighted digraph
NumberOfVertices The number of vertices in the edge-weighted digraph

Methods

Name Description
AddEdge Adds the specified directed edge to the edge-weighted digraph
Adjacent Returns an IEnumerable of the DirectedEdges incident from the specified vertex
Edges Returns an IEnumerable of all directed edges in the edge-weighted digraph
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.)
OutDegree Returns the number of directed edges incident from the specified vertex This is known as the outdegree of the vertex
ToString Returns a string that represents the current edge-weighted digraph (Overrides ObjectToString.)

See Also

Reference

RogueSharp.Algorithms Namespace

Other Resources

EdgeWeightedDigraph class from Princeton University's Java Algorithms

[11]: 2014-2016 Faron Bracy

Updated