DepthFirstTraversal

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>


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.

DetailsDetails

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=

has been superseded by DepthFirstScan:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Translate this page: