Description Usage Arguments Value
View source: R/graph_analysis.R
Determines whether a matrix forms a strongly connected graph.
1 |
w |
matrix to check. |
A statement that is either: 'The graph is strongly connected' or if the graph is not strongly connected then: 'The graph contains n strongly connected components and the largest one contains m nodes' where n and m will be determined.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.