图——边集数组

#include

using namespace std;

typedef char VertexType;
typedef int EdgeType;

const int MAXVEX = 100;
const int MAXEDGE = 100;

typedef struct Edges
{
int begin ,end;
EdgeType weight;
}Edges;

typedef struct Graph//图
{
VertexType vexs[MAXVEX];
Edges edges[MAXEDGE];
int numVertexes,numEdges;
}Graph;

//图->边集数组表示
void CreateGraph(Graph * G)//这里没有区分有向，无向统一进行处理
{
int i,j,k,w;
cout<<“请输入顶点数和边数:”<<endl;
cin>>G->numVertexes>>G->numEdges;
cout<<“请输入顶点名称:”<<endl;
for(i = 0;i < G->numVertexes;++i)//输入顶点
{
cin>>G->vexs[i];
}

for(k = 0;k < G->numEdges;++k)//完成邻接矩阵的填写工作
{
    printf("请输入边(vi,vj)上的下标i，下标j和权w：\n");
    cin>>i>>j>>w;
    G->edges[k].begin = i;
    G->edges[k].end = j;
    G->edges[k].weight = w;
}

}

void Show_Graph(Graph *G)//打印图的信息
{
cout<<“图的顶点，边数为：”<numVertexes<<","<numEdges<<endl;
cout<<“边集数组为：”<<endl;
for(int i = 0;i < G->numEdges;++i)
{
cout<< G->edges[i].begin<<"->"<edges[i].end<<" ("<edges[i].weight<<")"<<endl;
}
}

int main()
{
Graph *G = new Graph();
CreateGraph(G);
Show_Graph(G);
delete G;
}