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

int main()
{
	directedGraph G;

	G.addVertex("A");
	G.addVertex("B");
	G.addVertex("C");
	G.addVertex("D");
	G.addVertex("E");
	G.addVertex("F");
	G.addVertex("G");
	G.addVertex("Z");
	G.addVertex("W");

	G.addBasicEdge("Z", "W");

	G.addBasicEdge("A", "B");
	G.addBasicEdge("A", "D");
	G.addBasicEdge("A", "C");
	G.addBasicEdge("B", "E");
	G.addBasicEdge("C", "D");
	G.addBasicEdge("D", "F");
	G.addBasicEdge("E", "F");
	G.addBasicEdge("E", "G");
	G.addBasicEdge("F", "G");


	cout << G.shortestPath("A", "G") << endl;
	cout << G.shortestPath("D", "E") << endl;
	cout << G.shortestPath("D", "B") << endl;
	cout << G.shortestPath("C", "G") << endl;
	cout << G.shortestPath("W", "Z") << endl;
	cout << G.shortestPath("W", "A") << endl;

	return 0;
}