#include <iostream>
#include <iomanip>
using namespace std;
#include "Graph.h"
void main()
{
int i, n;
cout << "输入你所输入的有向带权图的顶点个数: ";
cin >> n;
adjmatrix g;
InitMatrix(g);
CreateMatrix(g);
cout << "你输入的有向带权图的邻接矩阵表示为: " << endl;
PrintMatrix(g, n);
int * d = new int [n];
edgenode ** path = new edgenode * [n];
cout << "请输入你要输入的源点: ";
cin >> i;
Dijkstra(g, d, path, i, n);
PrintPath(d, path, i, n);
}
you-xiang-dai-quan-tu.zip （11个子文件） 
有向带权图 
Graph.h 3KB 1.cpp 524B youxiangtuzuiduan.dsw 542B youxiangtuzuiduan.dsp 4KB Debug youxiangtuzuiduan.pch 1.92MB youxiangtuzuiduan.pdb 1.05MB vc60.idb 73KB 1.obj 250KB vc60.pdb 108KB youxiangtuzuiduan.ilk 773KB
youxiangtuzuiduan.exe 536KB资源评论
