#include <iostream>
#include <string>
#include "CityNode.h"
#include "RoadNode.h"
#include "Graph.h"

Graph::Graph()
{
	AdjacencyList = NULL ;
}

Graph::~Graph() 
{
	// loop thru all cities
		// delete all roads going out of that city
}

int Graph::Dijkstra(string city1, string city2)
{
	int Distance = 0 ;
	// start at city1
	// compute shortest path using Dijkstra's algorithm to city2
	// return distance
	return Distance ;
}

void Graph::InsertCity(string city)
{
	// insert city at begining of the adjacency list (just push it onto the front)
	// initially there are no roads to any other cities
}

void Graph::InsertRoad(string cityFrom, string cityTo, int distance)
{
	// find the city in the adjacency list
		// insert road at beginnning of the list (just push it onto the front)
}