Talk:Graph power
Add topicLatest comment: 6 years ago by Saforrest in topic Weighted graph
 | A fact from Graph power appeared on Wikipedia's Main Page in the Did you know column on 4 March 2013. The text of the entry was as follows:
|  |
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
Weighted graph
[edit]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)