Dear all, I have a brief question on the treatment of weights in calculating shortest paths. Are weights considered 'distances' or the opposite - i.e. if the weights are flows and I would consider to vertices close to each other if the weight is large, is shortest path doing the opposite? I would think that weights are treated in the same way throughout, making the question particularly relevant.
Many thanks for solving this small (but important!) point. Kindly, Bob Pap
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
