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

No inherent support for Undirected Graphs #652

Open

Akshat-Shu opened this issue Mar 18, 2025 · 0 comments

Akshat-Shu commented Mar 18, 2025

In it's current state, the library does not seem to provide any inherent support for undirected graphs.

Description
Currently, users must add an edge and a reverse edge manually in order to form a undirected graph which is prone to errors.

Expected Behaviour

When adding an edge (u, v), the library should automatically add (v, u) if the graph is undirected.
Ensure that operations like removing edges, traversals, and adjacency checks work seamlessly for undirected graphs.
Support for undirected mode in graphs so that algorithms meant specifically for undirected graphs can flag wrong inputs

Akshat-Shu mentioned this issue

Implement Hopcroft-karp algorithm to find the maximum matching #655

Open

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