struct Edge{//邊節(jié)點(diǎn)的定義 
int dest;//邊的另一頂點(diǎn)位置 
E cost;//邊上的權(quán)值 
Edge<T, E> *link;//下一條邊鏈指針 
Edge(){}//構(gòu)造函數(shù) 
Edge(int num, E weight):dest(num),cost(weight),link(NULL){}//構(gòu)造函數(shù) 
bool operator!=(Edge<T, E>& R)const{ 
return (dest!=R.dest)?true:false; 
} 
}; 
 
template <class T, class E> 
struct Vertex{//頂點(diǎn)的定義 
T data;//頂點(diǎn)的名字 
Edge<T, E> *adj;//邊鏈表的頭指針 
}; 

//在圖中刪除一個(gè)指定頂點(diǎn)v，v是頂點(diǎn)號(hào)。 
template <class T, class E> 
bool Graphlink<T,E>::removeVertex(int v){ 
 if(v<0||v>=numVertices||numVertices==1)return false; 
 
 Edge<T,E> *t, *p, *s; 
 int i, k; 
 
 while(NodeTable[v].adj!=NULL){ //將頂點(diǎn) 
 p = NodeTable[v].adj; 
 k = p->dest; 
 s = NodeTable[k].adj; 
 t = NULL; 
 while(s!=NULL&&s->dest!=v){ 
  t = s; s = s->link; 
 } 
 
 if(s!=NULL){ 
  if(t==NULL){//說(shuō)明第一條邊的另一個(gè)頂點(diǎn)就是v 
   NodeTable[k].adj = s->link; 
  } 
  else{ 
   t->link = s->link; 
  } 
  delete s; 
 } 
 //以上代碼是用來(lái)將頂點(diǎn)v的入度刪除 
 
 NodeTable[v].adj = p->link; 
 delete p;//刪除頂點(diǎn)v的邊 
 numEdges--; 
} 
//以上代碼將所有涉及到頂點(diǎn)v的邊都刪除了，接下來(lái)要調(diào)整表結(jié)構(gòu) 
 
 numVertices--; 
 
 NodeTable[v].data = NodeTable[numVertices].data; 
 p = NodeTable[v].adj = NodeTable[numVertices].adj; 
 
 //把原來(lái)頂點(diǎn)numVertices的入度改為頂點(diǎn)v的入度 
 while(p!=NULL){ 
  s = NodeTable[p->dest].adj; 
  while(s!=NULL){ 
  if(s->dest==numVertices){ 
  s->dest = v; 
  break; 
  } 
  else s = s->link; 
  } 
  p = p->link; 
 
 } 
 return true; 
}