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

Implement Yen's Algorithm #622

Open
asmit27rai opened this issue Mar 10, 2025 · 0 comments · May be fixed by #625
Open

Implement Yen's Algorithm #622

asmit27rai opened this issue Mar 10, 2025 · 0 comments · May be fixed by #625

Comments

@asmit27rai
Copy link

asmit27rai commented Mar 10, 2025 •
edited
Loading

Implement Yen's Algorithm for K-Shortest Paths

Description

Yen's Algorithm is a widely used algorithm for finding the K shortest paths between two nodes in a graph. This feature would be a valuable addition to the graph algorithms module, enabling users to find multiple alternative paths, which is useful in applications like network routing, transportation planning, and logistics.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

feat: Implement Yen's Algorithm for K-Shortest Paths asmit27rai/pydatastructs
1 participant
@asmit27rai