EdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>
Namespace: QuickGraph.Algorithms.Search
A edge depth first search algorithm for directed graphs
Constructors
| Constructor | Description |
new(g)
Signature: g:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> -> unit
|
|
new(visitedGraph, colors)
Signature: (visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
|
|
new(host, visitedGraph, colors)
Signature: (host:IAlgorithmComponent * visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
|
Instance members
| Instance member | Description |
BackEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
DiscoverTreeEdge
Signature: EdgeEdgeAction<'TVertex,'TEdge>
Modifiers: abstract |
|
EdgeColors
Signature: IDictionary<'TEdge,GraphColor>
Modifiers: abstract |
|
ExamineEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
FinishEdge
Signature: EdgeAction<'TVertex,'TEdge>
Modifiers: abstract |
|
ForwardOrCrossEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
InitializeEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
MaxDepth()
Signature: unit -> unit
|
|
StartEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
StartVertex
Signature: VertexAction<'TVertex>
|
|
TreeEdge
Signature: EdgeAction<'TVertex,'TEdge>
Modifiers: abstract |
|
Visit(se, depth)
Signature: (se:'TEdge * depth:int) -> unit
|
