Hi, I'm happy to introduce a PR<https://github.com/scipy/scipy/pull/20187> 18080 implementing Yen's <https://en.wikipedia.org/wiki/Yen%27s_algorithm> algorithm for finding the K shortest paths between two nodes in a graph.
This closes issue 18080<https://github.com/scipy/scipy/issues/18080>. See the PR for more details. I'm here for any questions. Regards, Tomer
_______________________________________________ SciPy-Dev mailing list -- scipy-dev@python.org To unsubscribe send an email to scipy-dev-le...@python.org https://mail.python.org/mailman3/lists/scipy-dev.python.org/ Member address: arch...@mail-archive.com
