Class DiGraph<T>
A directed graph implementation.
IEnumerable enumerates all vertices.
Implements
IDiGraph<T>
IEnumerable<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class DiGraph<T> : IGraph<T>, IDiGraph<T>, IEnumerable<T>
Type Parameters
Constructors
DiGraph()
Declaration
Properties
IsWeightedGraph
Declaration
public bool IsWeightedGraph { get; }
Property Value
VerticesAsEnumberable
Declaration
public IEnumerable<IGraphVertex<T>> VerticesAsEnumberable { get; }
Property Value
Type |
Description |
IEnumerable<IGraphVertex<T>> |
|
VerticesCount
Declaration
public int VerticesCount { get; }
Property Value
Methods
AddEdge(T, T)
Add an edge from source to destination vertex.
Time complexity: O(1).
Declaration
public void AddEdge(T source, T dest)
Parameters
Type |
Name |
Description |
T |
source |
|
T |
dest |
|
AddVertex(T)
Add a new vertex to this graph.
Time complexity: O(1).
Declaration
public void AddVertex(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Clone()
Declaration
public DiGraph<T> Clone()
Returns
ContainsVertex(T)
Declaration
public bool ContainsVertex(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Returns
GetEnumerator()
Declaration
public IEnumerator GetEnumerator()
Returns
Type |
Description |
IEnumerator |
|
GetVertex(T)
Declaration
public IDiGraphVertex<T> GetVertex(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Returns
Type |
Description |
IDiGraphVertex<T> |
|
HasEdge(T, T)
Do we have an edge between the given source and destination?
Time complexity: O(1).
Declaration
public bool HasEdge(T source, T dest)
Parameters
Type |
Name |
Description |
T |
source |
|
T |
dest |
|
Returns
InEdges(T)
Declaration
public IEnumerable<T> InEdges(T vertex)
Parameters
Type |
Name |
Description |
T |
vertex |
|
Returns
Type |
Description |
IEnumerable<T> |
|
OutEdges(T)
Declaration
public IEnumerable<T> OutEdges(T vertex)
Parameters
Type |
Name |
Description |
T |
vertex |
|
Returns
Type |
Description |
IEnumerable<T> |
|
RemoveEdge(T, T)
Remove an existing edge between source and destination.
Time complexity: O(1).
Declaration
public void RemoveEdge(T source, T dest)
Parameters
Type |
Name |
Description |
T |
source |
|
T |
dest |
|
RemoveVertex(T)
Remove an existing vertex frm graph.
Time complexity: O(V) where V is the total number of vertices in this graph.
Declaration
public void RemoveVertex(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Implements
IDiGraph<>
IEnumerable<>