C++ Exercises（十七）--图的简单实现

const int MAXSIZE = 50; //顶点最大数目

#include <vector>

using namespace std;

template<typename T>

class CGraph

#include "Graph.h"

#include <stack>

#include <queue>

#include <algorithm>

#include <iostream>

using namespace std;

template<typename T>

CGraph<T>::CGraph(void)

template<typename T>

CGraph<T>::~CGraph(void)

template<typename T>

int CGraph<T>::NumberOfEdges()const

template<typename T>

int CGraph<T>::NumberOfVertices()const

template<typename T>

int CGraph<T>::GetWeight(const T&vertex1,const T& vertex2)

template<typename T>

bool CGraph<T>::GraphFull()const

template<typename T>

bool CGraph<T>::GraphEmpty()const

template<typename T>

int CGraph<T>::InsertVertex(const T& vertex)

template<typename T>

void CGraph<T>::InsertEdge(const T& vertex1,const T& vertex2,int weight)

template<typename T>

void CGraph<T>::DeleteVertex(const T& vertex)

template<typename T>

void CGraph<T>::DeleteEdge(const T& vertex1,const T& vertex2)

template<typename T>

void CGraph<T>::CreateGraph()

template<typename T>

int CGraph<T>::GetVertexPos(const T& vertex)

template<typename T>

int CGraph<T>::FindVertex(const T &vertex,const vector<T> &lst)

template<typename T>

vector<T>& CGraph<T>::GraphDepthFirstSearch(const T& beginVertex)

template<typename T>

void CGraph<T>::ClearVisitFlag()

template<typename T>

void CGraph<T>::BreadthFirstSearch()

template<typename T>

vector<T>& CGraph<T>::GraphBreadthFirstSearch()

template<typename T>

vector<T>& CGraph<T>::GetNeighbors(const T& vertex)

template<typename T>

void CGraph<T>::DepthFirstSearch()

测试程序：

#include "Graph.cpp"

#include <iostream>

using namespace std;

int main(int argc, char* argv[])