graph-tool Digest, Vol 77, Issue 6

Just DFS? Isn't that slow? Maybe Tarjan's? Or Newman-Ziff's?

attachment.html (4.99 KB)

It *is* Tarjan's algorithm, which is just a DFS over the nodes. It has
linear complexity, so it is not slow. Newman-Ziff is for growing
networks, so it does not apply here.