//******************************************************************************
//
// Program:     Homework 8 -- President of railroad company
//
// Author:      Travis Dillon
// Email:       tdillon@ace.cs.ohiou.edu
//
// Description: This program read in an existing railroad network between
//              cities, travel time, demand, and cost for new links, and
//              the budget.  Then this program computes what tracks to build
//              in order to minimize the traveling time of the passengers.
//
// Date:        November 11, 2003
//
//******************************************************************************


#include "prog6.h"

int main()
{
   Graph ralph;
 
   ralph.read_num_vertices(cin, cout);  //O(1)
   ralph.read_vertices_name(cin, cout);  //O(n*n)
   ralph.read_travel_time(cin, cout);  //O(n*n)
   ralph.read_existing_links(cin, cout);  //O(n*n)
   ralph.read_demand(cin, cout);  //O(n*n)
   ralph.read_cost_of_link(cin, cout);  //O(n*n)
   ralph.read_funds_remaining(cin, cout);  //O(1)
   
   ralph.choose_new_connections(cin, cout);  //O(n*n*n*u)  n = number of cities
                                                         //u = number of unmade
                                                         //links between cities
   return EXIT_SUCCESS;
}