2011 算法设计QIU-LEC13.pdfVIP

(All-Pairs Shortest Paths) • Given:() 2 – Directed graph G = (V, E) () 3 4 Algorithms Design Analysis – Weight function w : E →R () 1 2 8 3 • Comp