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!
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!