//單源最短路徑,用于路權(quán)相等的情況,dijkstra優(yōu)化為bfs,鄰接表形式,復(fù)雜度O(m)
//求出源s到所有點(diǎn)的最短路經(jīng),傳入圖的大小n和鄰接表list,邊權(quán)值len
//返回到各點(diǎn)最短距離min[]和路徑pre[],pre[i]記錄s到i路徑上i的父結(jié)點(diǎn),pre[s]=-1
//可更改路權(quán)類型,但必須非負(fù)且相等!
#define MAXN 200
#define inf 1000000000
typedef int elem_t;
struct edge_t{
	int from,to;
	edge_t* next;
};

void dijkstra(int n,edge_t* list[],elem_t len,int s,elem_t* min,int* pre){
	edge_t* t;
	int i,que[MAXN],f=0,r=0,p=1,l=1;
	for (i=0;i<n;i++)
		min[i]=inf;
	min[que[0]=s]=0,pre[s]=-1;
	for (;r<=f;l++,r=f+1,f=p-1)
		for (i=r;i<=f;i++)
			for (t=list[que[i]];t;t=t->next)
				if (min[t->to]==inf)
					min[que[p++]=t->to]=len*l,pre[t->to]=que[i];
}