You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
// Is the undirected graph connected?
// Is the directed graph strongly connected?
and achieves this goal by checking if each vertex is reachable from each other one. This is unnecessarily resource-consuming and slow, O(n^3) (or even O(n^4)). You could call this a performance bug.
Please see PR397 (#397) that fixes this to run in O(N) (O(N+E)).
See the attached log_vec.txt for speed evaluation. log-vec.txt
(please tell if you're interested in the program that generates it)
The text was updated successfully, but these errors were encountered:
is_connected function is documented as
and achieves this goal by checking if each vertex is reachable from each other one. This is unnecessarily resource-consuming and slow, O(n^3) (or even O(n^4)). You could call this a performance bug.
Please see PR397 (#397) that fixes this to run in O(N) (O(N+E)).
See the attached log_vec.txt for speed evaluation.
log-vec.txt
(please tell if you're interested in the program that generates it)
The text was updated successfully, but these errors were encountered: