EulerianTrailAlgorithm<'TVertex, 'TEdge>
Namespace: QuickGraph.Algorithms
Constructors
| Constructor | Description |
new(visitedGraph)
Signature: visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
|
|
new(host, visitedGraph)
Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge>) -> unit
|
Construct an eulerian trail builder |
Instance members
| Instance member | Description |
AddTemporaryEdges(edgeFactory)
Signature: edgeFactory:EdgeFactory<'TVertex,'TEdge> -> List<'TEdge>
|
Adds temporary edges to the graph to make all vertex even. |
Circuit
Signature: List<'TEdge>
|
|
CircuitEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
RemoveTemporaryEdges()
Signature: unit -> unit
|
Removes temporary edges |
Trails()
Signature: unit -> ICollection<ICollection<'TEdge>>
|
Computes the set of eulerian trails that traverse the edge set. |
Trails(s)
Signature: s:'TVertex -> ICollection<ICollection<'TEdge>>
|
Computes a set of eulerian trail, starting at that spans the entire graph. |
TreeEdge
Signature: EdgeAction<'TVertex,'TEdge>
Modifiers: abstract |
|
VisitEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
Static members
| Static member | Description |
ComputeEulerianPathCount(g)
Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> int
|
Computes the number of eulerian trail in the graph. |
