The DepthFirstSearchAlgorithm type exposes the following members.

Constructors

  NameDescription
DepthFirstSearchAlgorithmOverloaded.

Methods

  NameDescription
ComputeOverloaded.
Equals
Determines whether the specified Object is equal to the current Object.
(Inherited from Object.)
Finalize
Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.
(Inherited from Object.)
GetHashCode
Serves as a hash function for a particular type.
(Inherited from Object.)
GetType
Gets the Type of the current instance.
(Inherited from Object.)
Initialize
Initializes the vertex color map
MemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
OnBackEdge
Raises the BackEdge event.
OnDiscoverVertex
Raises the DiscoverVertex event.
OnExamineEdge
Raises the ExamineEdge event.
OnFinishVertex
Raises the FinishVertex event.
OnForwardOrCrossEdge
Raises the ForwardOrCrossEdge event.
OnInitializeVertex
Raises the InitializeVertex event.
OnStartVertex
Raises the StartVertex event.
OnTreeEdge
Raises the TreeEdge event.
RegisterPredecessorRecorderHandlers
Registers the predecessors handler
RegisterTimeStamperHandlers
RegisterTreeEdgeBuilderHandlers
RegisterVertexColorizerHandlers
ToString
Returns a String that represents the current Object.
(Inherited from Object.)
Visit
Does a depth first search on the vertex u

Properties

  NameDescription
Colors
Gets the vertex color map
MaxDepth
Gets or sets the maximum exploration depth, from the start vertex.
VisitedGraph
Visited graph

Events

  NameDescription
BackEdge
Invoked on the back edges in the graph.
DiscoverVertex
Invoked when a vertex is encountered for the first time.
ExamineEdge
Invoked on every out-edge of each vertex after it is discovered.
FinishVertex
Invoked on a vertex 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
Invoked on forward or cross edges in the graph. (In an undirected graph this method is never called.)
InitializeVertex
Invoked on every vertex of the graph before the start of the graph search.
StartVertex
Invoked on the source vertex once before the start of the search.
TreeEdge
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.

See Also