Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
Graph.h
Go to the documentation of this file.00001 00017 #include <vector> 00018 #include <list> 00019 #include <map> 00020 #include "Edge.h" 00021 00022 using namespace std; 00023 00026 class Graph 00027 { 00028 public: 00029 int numVertices; 00030 int numEdges; 00035 vector<map<int, int> > adjList; 00036 00040 Graph(int n); 00041 00046 int getNumVertices() const; 00047 00052 int getNumEdges() const; 00053 00058 int getWeight(Edge e) const; 00059 00063 void add(Edge e); 00064 00068 void remove(Edge e); 00069 00074 map<int, int>::iterator findEdge(int v, int w); 00075 00076 }; // end Graph 00077 // End of header file
