New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Strongly Connected Components #38

Open

emperorz opened this issue Feb 20, 2019 · 0 comments

Labels

Projects

Community Ecosystem Board

emperorz commented Feb 20, 2019

Standard algorithm, good foundation for other algorithms.

Neo version is here: https://neo4j.com/docs/graph-algorithms/current/algorithms/strongly-connected-components/

I suggest we go with Tarjan's algorithm, though parallelisation may be poor as it is depth first.

O(|V|+|E|) i.e. linear time.

JonHerke-TG added the enhancement label

JonHerke-TG added this to 🧩 OPEN ISSUES 🧩 in Community Ecosystem Board

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment