dfs: The contained nodes in the sugraph after cutting the...
In Kahi-Na/Algorithme-GBC: GBC the Package of the Graph Based Clustering Method
Description
Usage
Arguments
Value
Description
The contained nodes in the sugraph after cutting the max_edge.
This function visits and mark the nodes of the subgraph after cutting the max_edge.
Usage
1
dfs(cur)
Arguments
cur
The current node
Value
It uses the Depth First Search algorithm to return the visited nodes after cutting the max_edge in order to check whether the subgraph remains connected after the cut or not.
dfs(currentnode)
Kahi-Na/Algorithme-GBC documentation built on May 4, 2019, 3:11 a.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.
Description Usage Arguments Value
Description
The contained nodes in the sugraph after cutting the max_edge. This function visits and mark the nodes of the subgraph after cutting the max_edge.
Usage
1 | dfs(cur)
|
Arguments
cur |
The current node |
Value
It uses the Depth First Search algorithm to return the visited nodes after cutting the max_edge in order to check whether the subgraph remains connected after the cut or not. dfs(currentnode)
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.