摘要：
Dijkstra算法View Code 1 /* 2 The Greedy Approach 3 The Shortest Path Problem 4 Time: 2012-11-19 17:56:57 5 Input: A weighted directed graph G = (V,E), where V = {1,2,...,n}. 6 Output: The distance from vertex 1 to every other vertex in G. 7 */ 8 #include <stdio.h> 9 #include <stdlib.h> 10 阅读全文
