Networkx algorithm [closed]

asked 2013-10-08 16:18:10 +0100

mresimulator gravatar image

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!

edit retag flag offensive reopen merge delete

Closed for the following reason duplicate question by tmonteil
close date 2013-10-08 16:56:16

add a comment