8/18/2019 Lee Algorithm

1/1

vector L[NMAX];int cst[NMAX];queue Q; int main(){  int N,M,start,i,now,x,y;  vector :: iterator it; 

freopen("bfs.in","r",stdin);  freopen("bfs.out","w",stdout); 

scanf("%d%d%d",&N,&M,&start);  for(i=1;i