Calculate the rank (the number of homotopy-inequivalent cycles) of the first discrete homotopy group of a graph.
The input graph. It will be treated as simple and undirected. A
submodule handles the case that
Logical, defaults to false. If true, returns a vector of
the A-1 ranks of the connected components of
1 2 3 4 5 6 7 8 9 10 11 12 13
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.