myDriver.cpp

#include <fstream>
#include "graphl.h"
#include "graphm.h"
using namespace std;

int main() {

	// part 1
	ifstream infile1("dataUWB.txt");
	if (!infile1) {
		cout << "File could not be opened." << endl;
		return 1;
	}

	//for each graph, find the shortest path from every node to all other nodes
	for (;;) {
		GraphM G;
		G.buildGraph(infile1);
		if (infile1.eof())
			break;
		G.findShortestPath();
		G.displayAll();              // display shortest distance, path to cout
		G.display(13, 1);              // display path from node 3 to 1 to cout
		G.display(23,1);
		G.display(1, 4);
		G.display(20, 22);
		G.display(15, 18);
		G.display(11, 23);
	}


	// part 2 
	ifstream infile2("data32.txt");
	if (!infile2) {
		cout << "File could not be opened." << endl;
		return 1;
	}

	//for each graph, find the depth-first search ordering
	for (;;) {
		GraphL G;
		G.buildGraph(infile2);
		if (infile2.eof())
			break;
		G.displayGraph();
		G.depthFirstSearch();    // find and display depth-first ordering to cout
	}

	cout << endl;
	return 0;
}