-
-
Notifications
You must be signed in to change notification settings - Fork 205
Add k_shortest_paths #972
Copy link
Copy link
Closed
Labels
wishlistFeature request that has not been chosen for implementation yet; vote or comment to prioritize it!Feature request that has not been chosen for implementation yet; vote or comment to prioritize it!
Milestone
Metadata
Metadata
Assignees
Labels
wishlistFeature request that has not been chosen for implementation yet; vote or comment to prioritize it!Feature request that has not been chosen for implementation yet; vote or comment to prioritize it!
What is the feature or improvement you would like to see?
The igraph core contains a function to compute k shortest paths with Yen's algorithm since March 2022. I noticed it has also been made available in the Python package of igraph recently. Is there any plan to make this available also in the R package?
I could try to start a PR based on the logic of the regular shortest_paths function, but have almost no experience in wrapping C code. Therefore the question if this is a planned addition already.
Use cases for the feature
Finding more "good" paths then only the shortest path, but without the need to compute all simple paths and subset them (which is very time consuming).
References
Issue on the igraph core repo about this function
Python docs for this function