Adding a complete C++ Backend for Graphs #708

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

Open

prex03 wants to merge 3 commits into codezonediitj:main from prex03:graph-cpp-backend

Contributor

prex03 commented Nov 28, 2025

This PR completes the C++ backend for remaining C++ graph algorithms. The algorithms include -

Kosaraju's for Strongly Connected Components
Tarjan's for Strongly Connected Components
Floyd Warshall for all pair shortest paths
Kahn's for Topological Sort
Edmonds Karp for Max Flow
Dinic for Max Flow

Equivalent tests have also been added for each algorithm for both adjacency list and matrix versions.

Prerak Singh added 3 commits

November 28, 2025 22:16


          completed cpp backend

9bdc529


          deleted build files

3c3d079


          bug fix

afb996b

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

Labels

None yet