DFS {simplifyNet}R Documentation

Depth First search

Description

Iterative depth first search.

Usage

DFS(Adj, v, discovered)

Arguments

Adj

Adjacency matrix.

v

Node to perform DFS from.

discovered

A list of discovered nodes from v. If initializing the search, should be all FALSE.

Details

Intended as internal function.

Value

Logical of length n where TRUE denotes connected to node v.

Author(s)

Andrew Kramer

Alexander Mercier


[Package simplifyNet version 0.0.1 Index]