摘要:
结构体:struct Node{ int to; LL cost; int next;}edge[2*MAX];邻接表的建立:void add_edge(int from,int to,LL cost){ tot++; edge[tot].to=to; edge[tot].cost=cost; edge[tot].next=head[from]; head[from]=tot;}spfa算法:void spfa(){ for(int i=1;i<=v;i++) { dis[i]=-1; } dis[1]=0;... 阅读全文