【模板】SPFA Dijkstra+Heap(priority_queue)
SPFA#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int M=500010;
const int N=100010;
struct E {int to,nxt,w;}edge[M];
queue<int>q;
bool vis[N];
int idx
原创
2016-04-30 12:13:40 ·
677 阅读 ·
0 评论