Class DiGraphVertex<T>
DiGraph vertex for adjacency list Graph implementation.
IEnumerable enumerates all the outgoing edge destination vertices.
Inheritance
DiGraphVertex<T>
Implements
IGraphVertex<T>
IEnumerable<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class DiGraphVertex<T> : IDiGraphVertex<T>, IGraphVertex<T>, IEnumerable<T>
Type Parameters
Constructors
DiGraphVertex(T)
Declaration
public DiGraphVertex(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Properties
InEdgeCount
Declaration
public int InEdgeCount { get; }
Property Value
InEdges
Declaration
public HashSet<DiGraphVertex<T>> InEdges { get; set; }
Property Value
Key
Declaration
public T Key { get; set; }
Property Value
OutEdgeCount
Declaration
public int OutEdgeCount { get; }
Property Value
OutEdges
Declaration
public HashSet<DiGraphVertex<T>> OutEdges { get; set; }
Property Value
Methods
GetEdge(IGraphVertex<T>)
Declaration
public IEdge<T> GetEdge(IGraphVertex<T> targetVertex)
Parameters
Type |
Name |
Description |
IGraphVertex<T> |
targetVertex |
|
Returns
Type |
Description |
IEdge<T> |
|
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type |
Description |
IEnumerator<T> |
|
GetOutEdge(IDiGraphVertex<T>)
Declaration
public IDiEdge<T> GetOutEdge(IDiGraphVertex<T> targetVertex)
Parameters
Type |
Name |
Description |
IDiGraphVertex<T> |
targetVertex |
|
Returns
Type |
Description |
IDiEdge<T> |
|
Implements
IGraphVertex<>
IEnumerable<>