ranjana-mishra
ranjana-mishra
@yulunwang if you specify exactly except what is provided by [PyGraph.remove_edge_from_index](https://www.rustworkx.org/apiref/rustworkx.PyGraph.remove_edge_from_index.html#rustworkx.PyGraph.remove_edge_from_index), what you want to achieve , I can work on that one.
> This pull request provides the function _get_k_shortest_paths_yen_ which finds _k_ shortest paths between a source vertex and a target vertex in a graph. If less than _k_ paths exist...
> Thanks for opening a PR adding this feature. I haven't looked at the code in any detail yet, before I did I saw some small administrative details: > >...
> Hi, > > I'm currently working on vehicle traffic networks and found this function quite interesting. While reviewing the code, I noticed that the costs of the shortest paths...
@mtreinish can you review the PR and suggest how we move forward.
Please review the PR - - it is fix over k-shortest paths ( same cost paths ), as that is not considering already visited points and fails on test cases....
New PR for this https://github.com/Qiskit/rustworkx/pull/1363