Class IsHamiltonianGraphAlgorithm
Algorithm that checks if a graph is Hamiltonian (has a path that links all vertices and pass one and only one time by each vertex).
Inheritance
System.Object
IsHamiltonianGraphAlgorithm
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 static class IsHamiltonianGraphAlgorithmMethods
| Improve this Doc View SourceIsHamiltonian<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge>)
Returns true if the graph is Hamiltonian, otherwise false.
Declaration
public static bool IsHamiltonian<TVertex, TEdge>(IUndirectedGraph<TVertex, TEdge> graph)
where TEdge : IUndirectedEdge<TVertex>Parameters
| Type | Name | Description |
|---|---|---|
| IUndirectedGraph<TVertex, TEdge> | graph | Graph to check. |
Returns
| Type | Description |
|---|---|
| System.Boolean | True if the |
Type Parameters
| Name | Description |
|---|---|
| TVertex | Vertex type. |
| TEdge | Edge type. |
Exceptions
| Type | Condition |
|---|---|
| System.ArgumentNullException |
|