A fact from Graph power appeared on Wikipedia's Main Page in the Did you know column on 4 March 2013 (check views). The text of the entry was as follows:
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
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.
