BidirectionalDepthFirstSearchAlgorithm<'TVertex, 'TEdge>
Namespace: QuickGraph.Algorithms.Search
A depth and height first search algorithm for directed graphs
Constructors
| Constructor | Description |
new(g)
Signature: g:IBidirectionalGraph<'TVertex,'TEdge> -> unit
|
|
new(visitedGraph, colors)
Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
|
|
new(host, visitedGraph, colors)
Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
|
Instance members
| Instance member | Description |
BackEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
DiscoverVertex
Signature: VertexAction<'TVertex>
|
|
ExamineEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
FinishVertex
Signature: VertexAction<'TVertex>
|
|
ForwardOrCrossEdge
Signature: EdgeAction<'TVertex,'TEdge>
|
|
GetVertexColor(vertex)
Signature: vertex:'TVertex -> GraphColor
Modifiers: abstract |
|
InitializeVertex
Signature: VertexAction<'TVertex>
|
|
MaxDepth()
Signature: unit -> unit
|
|
StartVertex
Signature: VertexAction<'TVertex>
|
|
TreeEdge
Signature: EdgeAction<'TVertex,'TEdge>
Modifiers: abstract |
|
VertexColors
Signature: IDictionary<'TVertex,GraphColor>
|
|
Visit(u, depth)
Signature: (u:'TVertex * depth:int) -> unit
|
