C++計(jì)算圖任意兩點(diǎn)間的所有路徑

class Graph 
{ 
private: 
 CArray<DataType,DataType> Vertices; 
 int Edge[MaxVertices][MaxVertices]; 
 int numOfEdges; 
public: 
 Graph(); 
 ~Graph(); 
 void InsertVertex(DataType Vertex); 
 void InsertEdge(int v1,int v2,int weight); 
 int GetWeight(int i,int j); 
 int GetVertices(); 
 DataType GetValue(int i); 
};

template<class T> 
class Stack 
{ 
private: 
 int m_size; 
 int m_maxsize; 
 T* data; 
public: 
 Stack(); 
 ~Stack(); 
 void push(T data); //壓棧 
 T pop(); //出棧，并返回彈出的元素 
 T peek(); //查看棧頂元素 
 bool isEmpty(); //判斷是否空 
 int getSize(); //得到棧的中元素個(gè)數(shù) 
 T* getPath(); //返回棧中所有元素 
}; 
template<class T> 
Stack<T>::Stack() 
{ 
 m_size=0; 
 m_maxsize=100; 
 data=new T[m_maxsize]; 
} 
template<class T> 
Stack<T>::~Stack() 
{ 
 delete []data; 
} 
template<class T> 
T Stack<T>::pop() 
{ 
 m_size--; 
 return data[m_size]; 
} 
 
template<class T> 
void Stack<T>::push(T d) 
{ 
 if (m_size==m_maxsize) 
 { 
  m_maxsize=2*m_maxsize; 
  T* new_data=new T[m_maxsize]; 
  for (int i=0;i<m_size;i++) 
  { 
   new_data[i]=data[i]; 
  } 
  delete []data; 
  data=new_data; 
 } 
 data[m_size]=d; 
 m_size++; 
} 
 
template<class T> 
T Stack<T>::peek() 
{ 
 return data[m_size-1]; 
} 
 
template<class T> 
bool Stack<T>::isEmpty() 
{ 
 if (m_size==0) 
 { 
  return TRUE; 
 } 
 else 
 { 
  return FALSE; 
 } 
} 
 
template<class T> 
T* Stack<T>::getPath() 
{ 
 T* path=new T[m_size]; 
 for (int i=0;i<m_size;i++) 
 { 
  path[i]=data[i]; 
 } 
 return path; 
} 
 
template<class T> 
int Stack<T>::getSize() 
{ 
 return m_size; 
} 

class CVertex 
{ 
private: 
 int m_num;//保存與該頂點(diǎn)相鄰的頂點(diǎn)個(gè)數(shù) 
 int *m_nei; //與該頂點(diǎn)相鄰的頂點(diǎn)序號(hào) 
 int *m_flag; //與該頂點(diǎn)相鄰的頂點(diǎn)是否訪問過 
 bool isin; //該頂點(diǎn)是否入棧 
public: 
 CVertex(); 
 void Initialize(int num,int a[]); 
 int getOne(); //得到一個(gè)與該頂點(diǎn)相鄰的頂點(diǎn) 
 void resetFlag(); //與該頂點(diǎn)相鄰的頂點(diǎn)全被標(biāo)記為未訪問 
 void setIsin(bool);//標(biāo)記該頂點(diǎn)是否入棧 
 bool isIn(); //判斷該頂點(diǎn)是否入棧 
 void Reset();//將isin和所有flag置0 
 ~CVertex(); 
 
};

CVertex::CVertex() 
{ 
 m_num=SIZE; 
 m_nei=new int[m_num]; 
 m_flag=new int[m_num]; 
 isin=false; 
 for (int i=0;i<m_num;i++) 
 { 
  m_flag[i]=0; 
 } 
  
} 
void CVertex::Initialize(int num,int a[]) 
{ 
 m_num=num; 
 for (int i=0;i<m_num;i++) 
 { 
  m_nei[i]=a[i]; 
 } 
} 
CVertex::~CVertex() 
{ 
 delete []m_nei; 
 delete []m_flag; 
} 
int CVertex::getOne() 
{ 
 int i=0; 
 for (i=0;i<m_num;i++) 
 { 
  if (m_flag[i]==0) //判斷是否訪問過 
  { 
   m_flag[i]=1; //表示這個(gè)頂點(diǎn)已經(jīng)被訪問，并將其返回 
   return m_nei[i]; 
  } 
 } 
 return -1; //所有頂點(diǎn)都已訪問過則返回-1 
} 
void CVertex::resetFlag() 
{ 
 for (int i=0;i<m_num;i++) 
 { 
  m_flag[i]=0; 
 } 
} 
void CVertex::setIsin(bool a) 
{ 
 isin=a; 
} 
bool CVertex::isIn() 
{ 
 return isin; 
} 
void CVertex::Reset() 
{ 
 for (int i=0;i<m_num;i++) 
 { 
  m_flag[i]=0; 
 } 
 isin=false; 
} 

int a[SIZE],num; 
for ( i=0;i<SIZE;i++) 
{ 
 num=0; 
 for (int j=0;j<SIZE;j++) 
 { 
   
  if (m_graph.Edge[i][j]!=MaxWeight&&i!=j) 
  { 
   a[num]=j; 
   num++; 
  } 
   
 } 
 vertex[i].Initialize(num,a); 

stack.push(selection1); //將起點(diǎn)壓棧 
vertex[selection1].setIsin(true); //標(biāo)記為已入棧 
int path_num=0; 
while (!stack.isEmpty()) //判斷棧是否空 
{ 
  
 int flag=vertex[stack.peek()].getOne(); //得到相鄰的頂點(diǎn) 
 if (flag==-1) //如果相鄰頂點(diǎn)全部訪問過 
 { 
  int pop=stack.pop(); //棧彈出一個(gè)元素 
  vertex[pop].resetFlag(); //該頂點(diǎn)相鄰的頂點(diǎn)標(biāo)記為未訪問 
  vertex[pop].setIsin(false); //該頂點(diǎn)標(biāo)記為未入棧 
  continue; //取棧頂?shù)南噜徆?jié)點(diǎn) 
 } 
 if (vertex[flag].isIn()) //若已經(jīng)在棧中，取下一個(gè)頂點(diǎn) 
 { 
  continue; 
 } 
 if (stack.getSize()>maxver-1) //判斷棧中個(gè)數(shù)是否超過了用戶要求的 ，這里是限制了一條路徑節(jié)點(diǎn)的最大個(gè)數(shù) 
 { 
  int pop=stack.pop(); 
  vertex[pop].resetFlag(); 
  vertex[pop].setIsin(false); 
  continue; 
 } 
 stack.push(flag); //將該頂點(diǎn)入棧 
  
 vertex[flag].setIsin(true); //記為已入棧 
  
 if (stack.peek()==selection2) //如果棧頂已經(jīng)為所求，將此路徑記錄 
 { 
  int *path=stack.getPath(); 
   //保存路徑的代碼省略 
  int pop=stack.pop(); //將其彈出，繼續(xù)探索 
   vertex[pop].setIsin(false); //清空入棧的標(biāo)志位 
 } 
  
}