Depth First Search
This function implements algorithm 4.2.1 of Gross and Yellen. The
input is a
graph and a
node to start from. It returns a
standard vertex labeling of
graph. This is a vector with
elements corresponding to the nodes of
graph and with values
that correspond to point in the depth first search the node is
DFS(object, node, checkConn=TRUE)
- An instance of the
characterindicating the starting node.
logicalindicating whether the connectivity of the graph should be checked.
This function implements algorithm 4.2.1 of Gross and Yellen. Specific details are given there.
It requires that the graph be connected. By default, this is checked, but since the checking can be expensive it is optional.
A faster and mostly likely better implementation of depth first
searching is given by
dfs in the RBGL
A vector with names given by the nodes of
graphwhose values are
0to one less than the number of nodes. These indices indicate the point at which the node will be visited.
Graph Theory and its Applications, J. Gross and J. Yellen.
RNGkind("Mersenne-Twister") set.seed(123) g1 <- randomGraph(letters[1:10], 1:4, p=.3) RNGkind() DFS(g1, "a")