//hapus(ii)
ii=argument0
for(iii=1;iii<=nq;iii+=1){
  if(q[iii]==ii)
  iv=iii;
}
if(iv<=nq){
  if(iv<nq){
  for(iii=iv;iii<=nq-1;iii+=1){
    q[iii]=q[iii+1];
  }
  }
  nq=nq-1;
}

// ketemu(ii)
ii=argument0
ff=false;
for(iii=1;iii<=nq;iii+=1){
  if(q[iii]==ii)
  ff=true;
}
return ff;

// dijkstra(s)
//where s is index of source vertex.
//
//Required data
//M[i,j]: Distance from vertex i to vertex j

 for(i=1;i<=n;i+=1){
  vertices_dist[i]=99999
  vertices_prev[i]=0
  q[i]=i
  nq=n
 }
 vertices_dist[s]=0;
 while(nq>0){
 
  d=vertices_dist[q[1]]
  u=q[1]
  if(nq>1){
  for(ii=2;ii<=nq;ii+=1){
  if(vertices_dist[q[ii]]<d){
    d=vertices_dist[q[ii]];
    u=q[ii];
  }
  }
  }

  if(vertices_dist[u]==99999) break;
  hapus(u);
  for(i=1;i<=n;i+=1){
  if(M[u,i]<99999 && M[u,i]>0){
    if(ketemu(i)){
    alt=vertices_dist[u]+M[u,i]
    if(alt<vertices_dist[i]){
      vertices_dist[i]=alt;
      vertices_prev[i]=u;
    }
    }
  }
  }
 }