Closed mdickinson closed 10 years ago
The issue is probably in the implementation of full_subgraph
, which iterates over all edges to decide which ones to add. That's unnecessary (doubly so, because the algorithm for computing strongly connected components finds the edges naturally; we're currently throwing that information away only to reconstruct it later).
... took several seconds for a graph of size 8000 or so; this feels as though there's some nonlinear behaviour going on somewhere.