Class IsEulerianGraphAlgorithm<TVertex, TEdge>

Algorithm that checks if a graph is Eulerian. (has a path using all edges one and only one time).

Inheritance
System.Object
IsEulerianGraphAlgorithm<TVertex, TEdge>
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: QuikGraph.Algorithms
Assembly: QuikGraph.dll
Syntax
public class IsEulerianGraphAlgorithm<TVertex, TEdge>
    where TEdge : IUndirectedEdge<TVertex>
Type Parameters
Name Description
TVertex

Vertex type.
TEdge

Edge type.

Constructors

| Improve this Doc View Source

IsEulerianGraphAlgorithm(IUndirectedGraph<TVertex, TEdge>)

Initializes a new instance of the IsEulerianGraphAlgorithm<TVertex, TEdge> class.

Declaration
public IsEulerianGraphAlgorithm(IUndirectedGraph<TVertex, TEdge> graph)
Parameters
Type Name Description
IUndirectedGraph<TVertex, TEdge> graph

Graph to check.
Exceptions
Type Condition
System.ArgumentNullException

graph is null.

Methods

| Improve this Doc View Source

CheckComponentsWithEdges()

Gets the component state of the current graph.

Declaration
public ComponentWithEdges CheckComponentsWithEdges()
Returns
Type Description
ComponentWithEdges

ComponentWithEdges state.
| Improve this Doc View Source

IsEulerian()

Returns true if the graph is Eulerian, otherwise false.

Declaration
public bool IsEulerian()
Returns
Type Description
System.Boolean

True if the graph is Eulerian, false otherwise.

Extension Methods