Cornellius Metto cornmetto
ALenfant
/ yen_igraph.py
Last active
October 26, 2022 19:39
Yen's algorithm for igraph, adapted from Wikipedia's pseudocode.
The arguments are:
graph: your igraph graph object (warning: the edge's id will change by using this function, so make a copy with gcopy if you want to keep them intact);
source: source vertex;
target: target vertex;
num_k: number of shortest paths you want;
weights: name of the ed…
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
| def path_cost(graph, path, weights=None): | |
| pathcost = 0 | |
| for i in range(len(path)): | |
| if i > 0: | |
| edge=graph.es.find(_source=path[i-1], _target=path[i]) | |
| if weights != None: | |
| pathcost += edge[weights] | |
| else: | |
| #just count the number of edges | |
| pathcost += 1 |