ImplicitEdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

Namespace: QuickGraph.Algorithms.Search

A edge depth first search algorithm for implicit directed graphs

Constructor	Description
`new(visitedGraph)` Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
`new(host, visitedGraph)` Signature: (host:IAlgorithmComponent * visitedGraph:IIncidenceGraph<'TVertex,'TEdge>) -> unit

Instance member	Description
`BackEdge` Signature: EdgeAction<'TVertex,'TEdge>	Invoked on the back edges in the graph.
`DiscoverTreeEdge` Signature: EdgeEdgeAction<'TVertex,'TEdge>
`EdgeColors` Signature: IDictionary<'TEdge,GraphColor>	Gets the vertex color map
`FinishEdge` Signature: EdgeAction<'TVertex,'TEdge>	Invoked on a edge after all of its out edges have been added to the search tree and all of the adjacent vertices have been discovered (but before their out-edges have been examined).
`ForwardOrCrossEdge` Signature: EdgeAction<'TVertex,'TEdge>	Invoked on forward or cross edges in the graph. (In an undirected graph this method is never called.)
`MaxDepth()` Signature: unit -> unit	Gets or sets the maximum exploration depth, from the start vertex.
`StartEdge` Signature: EdgeAction<'TVertex,'TEdge>	Invoked on the first edge of a test case
`StartVertex` Signature: VertexAction<'TVertex>	Invoked on the source vertex once before the start of the search.
`TreeEdge` Signature: EdgeAction<'TVertex,'TEdge> Modifiers: abstract	Invoked on each edge as it becomes a member of the edges that form the search tree. If you wish to record predecessors, do so at this event point.