Click or drag to resize

TraversalDepthFirstSearchAll Method

Returns all nodes with distance from nodeSource and predecesor based on Depth first search.

Namespace:  GraphLibrary
Assembly:  GraphLibrary (in GraphLibrary.dll) Version: 1.0.1
Syntax
C#
Copy
public List<Tuple<int, int, Nullable<int>>> DepthFirstSearchAll(
	BaseGraph graph,
	int nodeSource = 0,
	Nullable<int> nodeEnd = null,
	int maxDepth = 2147483647
)

Parameters

graph
Type: GraphLibrary.GraphsBaseGraph
BaseGraph graph.
nodeSource (Optional)
Type: SystemInt32
Node from where the DFS algorithm starts.
nodeEnd (Optional)
Type: SystemNullableInt32
maxDepth (Optional)
Type: SystemInt32

Return Value

Type: ListTupleInt32, Int32, NullableInt32
Returns nodes with distances and it's predecesor.
See Also