zhaoyanthu
guilhermemm
/ k_shortest_paths.py
Last active
May 12, 2021 02:47
Yen's K-Shortest Path Algorithm for NetworkX. Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. For more details, see http://en.m.wikipedia.org/wiki/Yen%27s_algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # -*- coding: utf-8 -*- | |
| """ | |
| A NetworkX based implementation of Yen's algorithm for computing K-shortest paths. | |
| Yen's algorithm computes single-source K-shortest loopless paths for a | |
| graph with non-negative edge cost. For more details, see: | |
| http://networkx.github.io | |
| http://en.m.wikipedia.org/wiki/Yen%27s_algorithm | |
| """ | |
| __author__ = 'Guilherme Maia <[email protected]>' |