#include <cstdio>
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
#define MAX 1005
const int INF = (1<<31)-1;
int n , m;
int first[MAX] , next[MAX];
int u[MAX] , v[MAX] , w[MAX];
void readGraph()
{
//
//
}
void bellman_ford(int start)
{
//
}
int main()
{
}
图论: Bellman_ford + 队列 + 邻接…
最新推荐文章于 2021-01-21 18:03:23 发布