// File: test1.cpp
//
// CMSC 341 Spring 2017
// Project 1 
//
// Basic testing of Graph class
//

#include <iostream>

// need this for pair template
//
#include <utility>
using namespace std ;

#include "Graph.h"

int main() {

   // G has 5 vertices numbered 0 thru 4
   Graph G(5) ;

   // add some edges
   G.addEdge(3,4) ;
   G.addEdge(1,4) ;
   G.addEdge(0,3) ;
   G.addEdge(0,4) ;
   G.addEdge(0,1) ;
   G.addEdge(1,2) ;
   G.addEdge(2,4) ;


   // dump out data structure
   G.dump() ;

   // Test neighbor iterator
   //
   Graph::NbIterator nit ;

   cout << "\nThe neighbors of vertex 4 are:\n" ;
   for (nit = G.nbBegin(4); nit != G.nbEnd(4) ; nit++) {
      cout << *nit << " " ;
   }
   cout << endl ;


   // Test edge iterator
   //
   Graph::EgIterator eit ;
   pair<int,int> edge ;

   cout << "\nThe edges in the graph are:\n" ;
   for (eit = G.egBegin() ; eit != G.egEnd() ; eit++) {

      edge = *eit ;   // get current edge

      // the two data members of a pair are first and second
      //
      cout << "(" << edge.first << ", " << edge.second << ") " ;

   }
   cout << endl ;
}