图的邻接矩阵与邻接表

邻接矩阵模板类

#include<iostream>
#include<cstdio>
using namespace std;
class Edge //边
{
public:
    int from,to,weight;
    Edge()
    {
        from=-1;to=-1;weight=-1;
    }
    Edge(int f,int t,int w)
    {
        from=f;to=t;weight=-1;
    }
};
class Graph{ //图
public:
    int numVertex; //结点个数
    int numEdge; //边的条数
    int *Mark; //标记访问结点
    int *Indegree; //结点入度
    int **matrix; //邻接矩阵，存放点和边的信息
    Graph(int num)
    {
        numVertex=num;
        numEdge=0;
        Indegree=new int[numVertex];
        Mark=new int[numVertex];
        for(int i=0;i<numVertex;i++) //初始化访问标记和入度
        {
            Mark[i]=0;
            Indegree[i]=0;
        }
        int i,j;
        matrix =(int * *)new int*[numVertex];
        for(i=0;i<numVertex;i++)matrix[i]=new int[numVertex]; //构造邻接矩阵
        for(i=0;i<numVertex;i++) //初始化邻接矩阵
            for(j=0;j<numVertex;j++)
                matrix[i][j]=0;
    }
    ~Graph(){
        delete[] Mark;
        delete[] Indegree;
        for(int i=0;i<numVertex;i++)
            delete [] matrix[i];
        delete[] matrix;
    }

    int VerticesNum(){return numVertex;}
    bool IsEdge(Edge oneEdge)
    {
        if(oneEdge.weight>0&&oneEdge.weight<1e9&&oneEdge.to>=0)
            return true;
        return false;
    }
    Edge FirstEdge(int oneVertex) //第一条边
    {
        Edge myEdge;
        myEdge.from=oneVertex;
        for(int i=0;i<numVertex;i++)
        {
            if(matrix[oneVertex][i]!=0)
            {
                myEdge.to=i;
                myEdge.weight=matrix[oneVertex][i];
                break;
            }
        }
        return myEdge;
    }
    Edge NextEdge(Edge preEdge){ //下一条边
        Edge myEdge;
        myEdge.from=preEdge.from;
        if(preEdge.to<numVertex)
        {
            for(int i=preEdge.to+1;i<numVertex;i++)
            {
                if(matrix[preEdge.from][i]!=0)
                {
                    myEdge.to=i;
                    myEdge.weight=matrix[preEdge.from][i];
                    break;
                }
            }
        }
        return myEdge;
    }
    void setEdge(int f,int t,int w) //添加一条边
    {
        if(matrix[f][t]<=0)
        {
            numEdge++;
            Indegree[t]++;
        }
        matrix[f][t]=w;
    }
    void delEdge(int f,int t) //删除一条边
    {
        if(matrix[f][t]>0)
        {
            numEdge--;
            Indegree[t]--;
        }
        matrix[f][t]=0;
    }
};

图的邻接表

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
class Edge{ //边类（单链表结点）
public:
    int from;
    int to;
    Edge * next;
    int weight;
    Edge(int t,int w,int f=-1,Edge *nex=NULL)
    {
        to=t;
        weight=w;
        from=f;
        next=nex;
    }
    Edge(Edge *nex=NULL)
    {
        to=-1;from=-1;weight=-1;next=nex;
    }
};
template <class T>
class Vertex{ //结点类
public:
    T data;
    Edge *head; //边的头结点
    int inDegree; //入度
    int outDegree; //出度
    int edgeNum; //结点边数
    Vertex(const T d) //带结点值的构造参数
    {
        data=d;
        head=new Edge();
        inDegree=0;
        outDegree=0;
        edgeNum=0;
    }
    Vertex() 
    {
        head=new Edge();
        inDegree=0;
        outDegree=0;
        edgeNum=0;
    }
    void delEdge() //删除所有边
    {
        Edge *p,*q;
        p=head->next;
        while(p!=NULL)
        {
            q=p;p=p->next;
            delete q;
        }
        head->next=NULL;
    }
};
template <class T>class Graph{
public:
    Vertex<T> *Vert;
    int vertexNum;
    int numEdge;
    int *Mark;
    Graph(int n)
    {
        numEdge=0;
        vertexNum=n;
        Mark=new int[n];
        Vert=new Vertex<T>[n];
        memset(Mark,0,sizeof(Mark));
    }
    void setVertex(const int i,const T d)
    {
        Vert[i].data=d;
    }
    bool insEdge(int f,int t,int w)//添加f到t权值为w的边
    {
        Edge *p,*q;
        q=new Edge(t,w,f);
        p=Vert[f].head;
        while(p->next!=NULL)
        {
            p=p->next;
        }
        p->next=q;
        Vert[f].edgeNum++;
        Vert[f].outDegree++;
        Vert[t].inDegree++;
        numEdge++;
    }
    bool delEdge(int f,int t) //删除f到t的边
    {
        Edge *p,*q;
        p=Vert[f].head;
        q=p->next;
        while(q->next!=NULL&&q->to!=t)
        {
            p=q;
            q=q->next;
        }
        if(q->to==t)
        {
            p->next=q->next;
            q->next=NULL;
            delete q;
            numEdge--;
            Vert[f].outDegree--;
            Vert[t].inDegree--;
            Vert[f].edgeNum--;
            return true;
        }
        return false;
    }
    void display()
    {
        for(int i=0;i<vertexNum;i++)
        {
            cout << i << ":";
            cout <<Vert[i].data<<"  "<<endl;
            Edge *p;
            p=Vert[i].head->next;
            while(p!=NULL)
            {
                cout << "Edge:"<<p->to <<" " <<p->weight <<endl;
                p=p->next;
            }
        }
        cout << "Vertex Num:" << vertexNum <<endl;
        cout << "Edge Num:" <<numEdge<<endl;
    }
    void Clear()
    {
        for(int i=0;i<vertexNum;i++)
        {
            Vert[i].delEdge();
            Vert[i].inDegree=Vert[i].outDegree=Vert[i].edgeNum=0;
        }
        numEdge=0;
        memset(Mark,0,sizeof(Mark));
    }
};
int main()
{
    Graph<int> g(5);
    int a,b,n;
    while(1)
    {
        for(int i=0;i<5;i++)
        {
            cout << "node :" << i <<endl;
            cout << "enter the node value"<<endl;
            cin>>a;
            g.setVertex(i,a);
            cout << "enter the number of edge" <<endl;
            cin>>n;
            cout << "enter the destination and weight" <<endl;
            for(int j=0;j<n;j++)
            {
                cin>>a>>b;
                g.insEdge(i,a,b);
            }
        }
        g.display();
        cout << "enter the delete edge"<<endl;
        cin >> a >>b;
        if(g.delEdge(a,b))cout <<"success"<<endl;
        else cout << "fail"<<endl;
        g.display();
        g.Clear();
    }
}
/*
0 2
1 2 3 4
1 1
3 1
2 0
3 0
4 1
2 1
4 2

0 2
1 2 3 4
1 1
3 1
2 0
3 0
4 1
2 1
0 1

0 2
1 2 3 4
1 1
3 1
2 0
3 0
4 1
2 1
0 2

*/