Interface IGraph<T>
UnDirected graph. (When implemented on a directed graphs only outgoing edges are considered as Edges).
Assembly: Advanced.Algorithms.dll
Syntax
public interface IGraph<T>
Type Parameters
Properties
IsWeightedGraph
Declaration
bool IsWeightedGraph { get; }
Property Value
ReferenceVertex
Declaration
IGraphVertex<T> ReferenceVertex { get; }
Property Value
VerticesAsEnumberable
Declaration
IEnumerable<IGraphVertex<T>> VerticesAsEnumberable { get; }
Property Value
VerticesCount
Declaration
int VerticesCount { get; }
Property Value
Methods
Clone()
Declaration
Returns
ContainsVertex(T)
Declaration
bool ContainsVertex(T key)
Parameters
| Type |
Name |
Description |
| T |
key |
|
Returns
GetVertex(T)
Declaration
IGraphVertex<T> GetVertex(T key)
Parameters
| Type |
Name |
Description |
| T |
key |
|
Returns
HasEdge(T, T)
Declaration
bool HasEdge(T source, T destination)
Parameters
| Type |
Name |
Description |
| T |
source |
|
| T |
destination |
|
Returns