performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered.
returns the edges of the graph that are traversed by the depth-first traversal in the order in which they are traversed.
returns the depth-first tree of the graph.
Basic Examples (2)
DepthFirstTraversal has been superseded by DepthFirstScan:
- Graph Algorithms
- Combinatorica Package
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics