# Heavy Transportation-poj1797(dijkstra或最大生成树)

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48  //dijkstra #include #include #define min(a,b) (af){ f=d[j]; k=j; } v[k]=1; for(j=1;j<=n;j++) if(!v[j]&&d[j]