1、
出处
struct edge {
int v, w;
};
vector<edge> e[maxn];
bool bellmanford(int n, int s) {
for (int i = 1; i <= n; i++) {
flag = false;
for (int u = 1; u <= n; u++) {
if (dis[u] == inf) continue;
for (auto ed : e[u]) {
int v = ed.v, w = ed.w;
}
}
}
return flag;
}
2、
出处
struct node
{
int dis, pos;
bool operator <(const node &x)const
{
return x.dis < dis;
}
}
priority_queue<node> q;
求大佬解答,万分感谢orz