数据结构资料_chapter11.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Shortest Paths Definitions d(A, B) is the shortest distance from vertex A to B. w(A, B) is the weight of the edge connecting A