#define SIZE 10class Graph
{
public:Graph(){MaxVertices = SIZE;NumVertices = NumEdges = 0;VerticesList = new char[sizeof(char)*MaxVertices];Edge = new int*[sizeof(int*)*MaxVertices];int i,j;for(i = 0;i<MaxVertices;i++)Edge[i] = new int[sizeof(int)*MaxVertices];for(i = 0;i<MaxVertices;i++){for(j = 0;j<MaxVertices;++j)Edge[i][j] = 0;}}void ShowGraph(){int i,j;cout<<"  ";for(i = 0;i<NumVertices;i++)cout<<VerticesList[i]<<" ";cout<<endl;for(i = 0;i<NumVertices;i++){cout<<VerticesList[i]<<" ";for(j = 0;j<NumVertices;j++)cout<<Edge[i][j] <<" ";cout<<endl;}cout<<endl;}int GetVertexPos(char v){int i;for(i = 0;i<NumVertices;i++){if(VerticesList[i] == v)return i;}return -1;}~Graph(){Destroy();}void Insert(char v){if(NumVertices < MaxVertices){VerticesList[NumVertices] = v;NumVertices++;   }}void InsertEdge(char v1,char v2)  {int i,j;int p1 = GetVertexPos(v1);  int p2 = GetVertexPos(v2);if(p1 == -1 || p2 == -1)return ;Edge[p1][p2] = Edge[p2][p1] = 1;NumEdges++;  }void RemoveEdge(char v1,char v2){int p1 = GetVertexPos(v1);int p2 = GetVertexPos(v2);if(p1 == -1 || p2== -1)return;if(Edge[p1][p2] == 0) return;Edge[p1][p2] = Edge[p2][p1] = 0;NumEdges--;}void Destroy(){delete[] VerticesList;VerticesList = NULL;for(int i = 0;i<NumVertices;i++){delete Edge[i];Edge[i] = NULL;}delete[] Edge;Edge = NULL;MaxVertices = NumVertices = 0;}void RemoveVertex(char v){int i,j;int p = GetVertexPos(v);int reNum = 0;if(p == -1)return;for(i = p;i<NumVertices-1;i++) {VerticesList[i] = VerticesList[i+1];}for(i = 0;i<NumVertices;i++){if(Edge[p][i] != 0)reNum++;}for(i = p;i<NumVertices-1;i++){for(j = 0;j<NumVertices;j++){Edge[i][j] = Edge[i+1][j];}}for(i = p;i<NumVertices;i++){for(j = 0;j<NumVertices;j++)Edge[j][i] = Edge[j][i+1];}NumVertices--;NumEdges = NumEdges - reNum;}
private:int MaxVertices;int NumVertices;int NumEdges;char *VerticesList;int **Edge;
};

#define SIZE 10
typedef char T;
struct Edge
{Edge(int v):destvalue(v),link(NULL){}int destvalue;Edge *link;
};
struct Vertex
{Vertex():list(NULL){}T data;Edge *list;
};
class GraphLnk
{
public:GraphLnk();~GraphLnk(){}void InsertVertex(T v);void InsertEdge(T v1,T v2);int GetVertexI(T v);void ShowGraph();void RemoveEdge(T v1,T v2);void RemoveVertex(T v);void DestroyGraph();
private:int MaxVertex;int NumVertex;int NumEdge;Vertex *VertexTable;
};GraphLnk::GraphLnk()
{MaxVertex = SIZE;NumVertex = NumEdge = 0;VertexTable = new Vertex[MaxVertex];
}
void GraphLnk::InsertVertex(T v)
{if(NumVertex >= MaxVertex)return;VertexTable[NumVertex++].data = v;
}
void GraphLnk::ShowGraph()
{int i;for(i = 0;i<NumVertex;i++){cout<<i<<" "<<VertexTable[i].data<<":->";Edge *p = VertexTable[i].list;while(p != NULL){cout<<p->destvalue<<"->";p = p->link;}cout<<"nul"<<endl;}cout<<endl;
}
int GraphLnk::GetVertexI(T v)
{int i;for(i = 0;i<NumVertex;i++){if(VertexTable[i].data == v)return i;}return -1;
}
void GraphLnk::InsertEdge(T v1,T v2)
{int p1 = GetVertexI(v1);int p2 = GetVertexI(v2);if(p1 == -1 || p2 == -1)return;//v1 -> v2Edge *ed = new Edge(p2);ed->link = VertexTable[p1].list;VertexTable[p1].list = ed;//v2 -> v1ed = new Edge(p1);ed->link = VertexTable[p2].list;VertexTable[p2].list = ed;NumEdge++;
}void GraphLnk::RemoveEdge(T v1,T v2)
{int p1 = GetVertexI(v1);int p2 = GetVertexI(v2);if(p1 == -1 || p2 == -1)return;Edge *q = NULL;              //标识要删除边链表的前一个Edge *p;
p = VertexTable[p1].list;    //从链表开头开始//查找v2所在位置while(p != NULL && p->destvalue != p2){q = p;p = p->link;}if(p == NULL)          //两个顶点之间没有边的存在¨return;//找到所要删除的边if(q == NULL)      //所要删除的为链表开头
        {VertexTable[p1].list = p->link;}else{q->link = p->link;}delete p;p = NULL;q = NULL;p = VertexTable[p2].list;while(p->destvalue != p1){q = p;p = p->link;}if(q == NULL){VertexTable[p2].list = p->link;}else{q->link = p->link;}delete p;p = NULL;NumEdge--;
}void GraphLnk::RemoveVertex(T vertex)
{int v  = GetVertexI(vertex);if(v == -1)return;//删除和结点相关的边Edge*p=VertexTable[v].list;Edge *s;Edge *t = NULL;int k;while(p != NULL){k = p->destvalue;s = VertexTable[k].list;while(s != NULL&&s->destvalue != v){t = s;s = s->link;}if(s != NULL){if(t == NULL)     //第一个结点
            {VertexTable[k].list = s->link;}else{t->link = s->link;}delete s;s = NULL;}VertexTable[v].list = p->link;delete p;p = VertexTable[v].list;}/*删除结点，用最后一个结点覆盖要删除的结点，并把和最后一个结点相关联的边的下标改正*/NumVertex--;VertexTable[v].data = VertexTable[NumVertex].data; VertexTable[v].list = VertexTable[NumVertex].list;
s = VertexTable[v].list;while(s != NULL){k = s->destvalue;p = VertexTable[k].list;while(p != NULL){if(p->destvalue == NumVertex)
            {p->destvalue = v;break;}p = p->link;}s = s->link;}
}void GraphLnk::DestroyGraph()
{Edge *p;for(int i = 0;i<NumVertex;i++){p = VertexTable[i].list;while(p != NULL){VertexTable[i].list = p->link;delete p;p = VertexTable[i].list;}}delete []VertexTable;MaxVertex = NumEdge = NumVertex = 0;
}