Re: [graph-tool] slow shortest path

Joel Moberg <joel.moberg <at> gmail.com> writes:

Thanks! I will see what can be done to remove unnecessary shortest path computations. But I change edge weights only if they are on the shortest path, which usually contains three or four edges. So four shortest path will cost more than 100 sec while one shortest path computation usually costs less than 1 sec. I don't know what went wrong.