A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (Q4876371)
From MaRDI portal
scientific article; zbMATH DE number 872763
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for minimum spanning tree using depth-first-search in an undirected graph |
scientific article; zbMATH DE number 872763 |
Statements
A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (English)
0 references
1 May 1996
0 references
minimum spanning tree
0 references
