判有没有负环
然后用SPFA搞就行,紫书上只说了可以用spfa搞,加个结点,但是没说具体怎么搞,后来现学了一发就行,加个0号节点,然后往其他所有点连一个权值为0的边,然后从0号节点跑spfa就行
貌似还有一种DFS版的spfa,也可以判负环,但是那个只能从某个定点出发啊,感觉限制性还是挺大的
正好也收一个spfa判负环的版
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define maxn 505
#define maxm 5500
#define INF 0x3f3f3f3f
struct Node
{
int u, v, val;
Node()
{
u = 0; v = 0; val = 0;
}
Node(int u, int v, int val)
{
this->u = u; this->v = v; this->val = val;
}
};
int N, M, W;
int grid[505][505];
vector<Node> graph[maxn];
bool inq[maxn];
int cnt[maxn];
int dist[maxn];
int s, e, t;
bool spfa()
{
queue<int> Q;
memset(dist, 0x3f, sizeof(int)*maxn);
memset(inq, 0, sizeof(inq));
memset(cnt, 0, sizeof(int)*maxn);
inq[0] = true;
dist[0] = 0;
Q.push(0);
while (!Q.empty())
{
int u = Q.front(); Q.pop();
inq[u] = false;
for (unsigned int i = 0; i < graph[u].size(); ++i)
{
e = graph[u][i].v;
t = graph[u][i].val;
//printf("edge %d %d\n", u, e);
if (dist[u] < INF&&dist[u] + t < dist[e])
{
dist[e] = dist[u] + t;
//printf("%d %d\n", e, dist[e]);
if (!inq[e])
{
Q.push(e);
inq[e] = true;
if (++cnt[e] > N)
{
return false;
}
}
}
}
}
return true;
}
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int F;
scanf("%d", &F);
while (F--)
{
bool can = true;
scanf("%d%d%d", &N, &M, &W);
for (int i = 0; i < M; ++i)
{
scanf("%d%d%d", &s, &e, &t);
graph[s].push_back(Node(s, e, t));
graph[e].push_back(Node(e, s, t));
}
for (int i = 0; i < W; ++i)
{
scanf("%d%d%d", &s, &e, &t);
graph[s].push_back(Node(s, e, -t));
}
for (int i = 1; i <= N; ++i)
{
graph[0].push_back(Node(0, i, 0));
}
if (spfa())
can = false;
if (can)
printf("YES\n");
else
printf("NO\n");
for (int i = 0; i <= N; ++i)
graph[i].clear();
}
//system("pause");
//while (1);
return 0;
}