用Dijkstra算法实现单源最短路径问题

#include<iostream.h>

#define INFINITE 1000

int main()
{
 int j,i,n,k,t,**w,*s,*p,*d;

 cin>>n;
 
 d = new int[n];
 s = new int[n];
 p = new int[n];
 w = new int*[n];

 for(i = 0; i < n; i++)
 {
  w[i] = new int[n];
 }

 for(i = 0; i < n; i++)
  for(j = 0; j < n; j++)
  {
   cin>>w[i][j];
   if(w[i][j]==-1)
   {
   w[i][j]=1000;
   }
  }