//******************************************************************************
//
// Cs361      : Fall 2003 Ohio University Travis Dillon
// Homework 7 : Data Structures R Us Shipping Company
// file       : graph.h
// started    : 10-14-03
// summary    : This is the header for the Graph class.
//
//******************************************************************************


#ifndef GRAPH_H
#define GRAPH_H

#include "node.h"

class Node;

class Graph
{
 public:
   Graph();

   void read_num_vertices(istream& fin, ostream& fout);
   void read_vertices_name(istream& fin, ostream& fout);
   void read_edges(istream& fin, ostream& fout);
   void read_route(istream& fin, ostream& fout);

   void insert_edge(ostream& fout, string from, string to, float the_weight);
   size_t get_id(ostream& fout, string in_name);
   
   float get_length(size_t from, size_t to);
   void shortest_path(ostream& fout);
   size_t choose(const float dist[], const bool set[]);
   void show_path(ostream& fout);
   void show_path(ostream& fout, size_t index);
   float get_weight(size_t from, size_t to);

 private:
   int num_edges;  //number of edges in the graph
   int num_units;
   int num_vertices;  //number of vertices in the graph
   list<Node>* array;  //array of pointers to lists
   vector<string> names;  //vector of strings of names of verticies
   size_t departure;
   size_t destination;
   size_t** where_from;
   float total_cost;
};

#endif  //GRAPH_H