DFS: Depth First search
In simplifyNet: Network Sparsification
DFS 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
simplifyNet documentation built on Nov. 15, 2022, 5:05 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| DFS | 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 |
Details
Intended as internal function.
Value
Logical of length n where TRUE denotes connected to node v.
Author(s)
Andrew Kramer
Alexander Mercier
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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.