Skip to content
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 #43

Open
neoblizz opened this issue Dec 11, 2022 · 3 comments
Open

Strongly Connected Components #43

neoblizz opened this issue Dec 11, 2022 · 3 comments
Labels
good first issue Good for newcomers graph-algorithm Graph algorithm related issues.

Comments

@neoblizz
Copy link
Member

No description provided.

@neoblizz neoblizz added good first issue Good for newcomers graph-algorithm Graph algorithm related issues. labels Dec 11, 2022
@LuisHDantas
Copy link

Hey, can I work on that issue?

@kdeweese
Copy link
Collaborator

Hi Luis,

Thank you for your interest. For many of the algorithms in our proposal to the standard's committee we already have tentative algorithm interfaces, including two for SCC, one based on Kosaraju's SCC (which is the one first taught in CLRS), and the other based on Tarjan's SCC. For Kosaraju I've already been working on a reference implementation. Would you be willing to work on Tarjan's SCC? Otherwise is there another algorithm you are interested in implementing?

@LuisHDantas
Copy link

Sounds great! I am looking foward to working on Tarjan's SCC, thank you!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
good first issue Good for newcomers graph-algorithm Graph algorithm related issues.
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@kdeweese @neoblizz @LuisHDantas