Hi experts!
I know that shortest_path() function (Networkx ) uses Dijkstra algorithm.
What algorithm is based connected_components() function?
Waiting for your answers.
Thanks a lot.
Best regards!
Revision history [back]
 | 1 | initial version |
| | 1 | initial version |
Hi experts!
I know that shortest_path() function (Networkx ) uses Dijkstra algorithm.
What algorithm is based connected_components() function?
Waiting for your answers.
Thanks a lot.
Best regards!
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.