Talk:Graph power

Weighted graph
Any references? If vertex A->B is weight a and vertex B->C is weight b, then the new edge A->C should be weight a+b?

Darcourse (talk) 16:48, 22 April 2020 (UTC)


 * I was wondering the same thing myself. I think the logical extension is that the weight of the edge A->C should be the minimum of weight(A->V) + weight(V->C) for all vertices V in the graph. If in your example, the only path from A to C is through B, then this minimum would be a+b as you say.
 * This definition happens to be a tropical matrix power. --Saforrest (talk) 11:11, 27 July 2020 (UTC)