Path-based depth-first search for strong and biconnected components (Q294748)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Path-based depth-first search for strong and biconnected components |
scientific article; zbMATH DE number 6594084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path-based depth-first search for strong and biconnected components |
scientific article; zbMATH DE number 6594084 |
Statements
Path-based depth-first search for strong and biconnected components (English)
0 references
16 June 2016
0 references
depth-first search
0 references
strongly connected component
0 references
biconnected component
0 references
stack
0 references
graph algorithms
0 references
0.8612881
0 references
0.8528568
0 references
0.8517669
0 references
0 references
0.8478553
0 references
0.84589136
0 references
0 references
0.84342164
0 references
