Description Usage Arguments Details Value Author(s) References See Also Examples

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
visited.

1 |

`object` |
An instance of the |

`node` |
A |

`checkConn` |
A |

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
package.

A vector with names given by the nodes of `graph`

whose values
are `0`

to one less than the number of nodes. These indices
indicate the point at which the node will be visited.

R. Gentleman

*Graph Theory and its Applications*, J. Gross and J. Yellen.

1 2 3 4 5 |

graph documentation built on Nov. 8, 2020, 6:02 p.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.