Closed AntoineBut closed 2 months ago
Generating a graph of size N using the dorogovtsev_mendes algorithm should run in $O(N)$ and not $O(N^2)$. (see source)
I actually don't really understand why this has been implemented this way, and I can try to make a more efficient implementation.
that would be a welcome contribution, thanks!
Generating a graph of size N using the dorogovtsev_mendes algorithm should run in $O(N)$ and not $O(N^2)$. (see source)
I actually don't really understand why this has been implemented this way, and I can try to make a more efficient implementation.