//最短路徑算法PshortPM.cpp
#include<iostream.h>
#include<iomanip.h>
#include<stdlib.h>
#include "graph0.cpp"
#include "PshortP.h"
//狄克斯特拉算法測試
void main()
{cout<<"PShortPM.cpp運行結果:\n";
 int n=6,e=9,k2=1;
 RCW rcw[]={{0,2,5},{0,3,30},{1,0,2},{1,4,8},
  {2,1,15},{2,5,7},{4,3,4},{5,3,10},{5,4,18}};
 AdjMatrix g(n,k2);
 g.Creatgraph(n,e,rcw);
 int m=g.NumV();
 int *dist=new int[m];
 int *path=new int[m];
 int v0=0;
 PShortPath(g,v0,dist,path);
 cout<<"從頂點"<<g.GetValue(v0)
     <<"到其他各頂點的最短距離為:\n";
 for(int i=0;i<m;i++)
  cout<<"到頂點"<<g.GetValue(i)
      <<"的最短距離為:"<<dist[i]<<endl;
 cout<<"從頂點"<<g.GetValue(v0)
     <<"到其他各頂點的最短路徑的前一頂點為:\n";
 for(i=0;i<m;i++)
  if(path[i]!=-1)
   cout<<"到頂點"<<g.GetValue(i)<<"的前一頂點為:"
       <<g.GetValue(path[i])<<endl;
 cin.get();}