wex13_25.cpp

来自「数据结构C++代码,经典代码,受益多多,希望大家多多支持」· C++ 代码 · 共 36 行

#include <iostream.h>
#include <fstream.h>
#pragma hdrstop

// include the Graph class modified to implement MinimumLength
#include "wex13_25.h"

void main(void)
{
	Graph<char> G;
	char fname[20], startV;

	cout << "Enter the graph file name: ";
	cin >> fname;
	cout << "Enter the starting vertex: ";
	cin >> startV;
	
	G.ReadGraph(fname);

	VertexLength(G, startV);
} 

/*
<Run>

Enter the graph file name: wex13_25.dat
Enter the starting vertex: A
Minimum length from A to A = 1
Minimum length from A to B = 2
Minimum length from A to C = 3
Minimum length from A to D = 5
Minimum length from A to E = 4
Minimum length from A to F = 6
Minimum length from A to G = 6
*/