摘要: #include#include#includeusing namespace std;struct edge{ int from,to,cost;};struct vertex{ int value,rank;};const int Max=110;const int INF=0x7fffffff;edge es[Max*Max];vertex v[Max];int dist[Max],en=1;int ans=0x7fffffff;void bellman(int n, int m){ int i; dist[0]=0; while(true){ ... 阅读全文
posted @ 2013-11-07 17:39 Neptunes 阅读(165) 评论(0) 推荐(0) 编辑