//******************************************************************************
//
// Program:     Homework 6 -- Network manager for large software company
//
// Author:      Travis Dillon
// Email:       tdillon@ace.cs.ohiou.edu
//
// Description: This program reads input of a connected computer network.
//              It then readuces the connections so there is no redundancy.
//              It keeps the largest connections open.  Then outputs the
//              new network
//
// Date:        October 21, 2003
//
//******************************************************************************


#include "prog4.h"

int main()
{
   Graph ralph;

   ralph.read_directed(cin, cout);  //O(1)
   ralph.read_num_vertices(cin, cout);  //O(1)
   ralph.read_vertices_name(cin, cout);  //O(n*n) n = number of vertices
   ralph.read_num_edges(cin, cout);  //O(1)
   ralph.read_edges(cin, cout);  //O(n*n or n*e)  n = num vertices,
                                                //e = number of edges

   ralph.find_network();  //O(n*e)  e = num edges, n = num vertices
   ralph.simplify();  //O(e) e = number of edges

   ralph.show_all(cout);  //O(e) e = number of edges in the graph

   return EXIT_SUCCESS;
}