main.cpp

分别用floyd 和dijkstra算法计算城市间最短路径的简单例子

#include <iostream>
#include <string>
#include "graph.h"
using namespace std;

int main(int argc, char *argv[])
{
	string infilename=argv[1];
	Graph map;
	map.read(infilename);
	cout<<"Loading from "<<infilename<<"...\n";
	map.write();
	map.Floyd();
	map.Dijkstra();
	map.printFlights();
	return 0;
}