python networkx进行最短路径分析_python-Igraph / networkx中的k最短路径实现(日元...

经过深入研究并基于this,this等,我建议实现k最短路径算法,以便在大型无向,循环加权图中找到第一,第二,第三…第k个最短路径.大约2000个节点.

Wikipedia上的伪代码是这样的：

function YenKSP(Graph, source, sink, K):

//Determine the shortest path from the source to the sink.

A[0] = Dijkstra(Graph, source, sink);

// Initialize the heap to store the potential kth shortest path.

B = [];

for k from 1 to K:

// The spur node ranges from the first node to the next to last node in the shortest path.

for i from 0 to size(A[i]) ? 1:

// Spur node is retrieved from the previous k-shortest path, k ? 1.

spurNode = A[k-1].node(i);

// The sequence of nodes from the source to the spur node of the previous k-shortest path.

rootPath = A[k-1].nodes(0, i);

for each path p in A:

if rootPath == p.nodes(0, i):

// Remove the links that are part of the previous shortest paths which