#include <cstdio>
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
#define MAX 100
const int INF = (1<<31)-1;
typedef pair<int,int> pii;
//priority_queue< int, vector<int>, cmp > 优先队列.cmp设置队列中先出队列的优先级
priority_queue< pii, vector<pii>, greater<pii> > q;
int n , m;
int first[MAX] , next[MAX];
int u[MAX], v[MAX], w[MAX];
void readGraph()
{
}
void dijkstra(int start)
{
}
int main()
{
}
图论: 邻接表 + STL优先队列 + dij…
最新推荐文章于 2022-07-06 09:34:48 发布