图的存储方式

#include <iostream>
#include <cstdlib>
using namespace std;
#define MAX 100

typedef  struct
{
	char V[MAX];				//顶点集
	int Matrix[MAX][MAX];		//邻接矩阵
	int numV;					//顶点个数
	int numE;					//边的个数
}Graph;
void CreateGraph(Graph *G)
{
	int i, j, k;
	cout << "请输入顶点数和边数：\n";
	cin >> G->numV >> G->numE;
	//getchar();
	cout << "请输入顶点信息：\n";
	for (i = 0; i < G->numV; i++)
		cin >> G->V[i];

	for (i = 0; i < G->numV; i++)
		for (j = 0; j < G->numV; j++)
			G->Matrix[i][j] = 0;

	cout << "请输入边信息：(两个顶点)\n";
	for (k = 0; k < G->numE; k++)
	{
		cin >> i >> j;		//i和j之间有边
		//因为无向图的矩阵是对称的
		G->Matrix[i][j] = 1;
		G->Matrix[j][i] = 1;
		//如果是加权图，那么也应该输入权值。
	}

}
int main()
{
	int i, j;
	Graph *graphHead = (Graph *)malloc(sizeof(Graph));
	CreateGraph(graphHead);
    cout << "邻接表如下所示：\n";
	for (i = 0; i < graphHead->numV; i++)
	{
		for (j = 0; j < graphHead->numV; j++)
			cout << graphHead->Matrix[i][j] << "\t";
		cout << '\n';
	}
	system("pause");
}

#include<cassert>
#include<iostream>
#include<cstdlib>
using namespace std;

typedef struct AdjListNode_
{
	int num;	//顶点编号
	int weight;	//顶点权值
	struct AdjListNode_ *next;	//指向下一个节点
}AdjListNode;

typedef struct AdjList_
{
	AdjListNode * head;		//头指针
}AdjList;

typedef struct Graph_
{
	int numv, nume;		//顶点个数和边个数
	AdjList *array;
}Graph;

/*创建V个顶点的图*/
Graph* CreateGraph(Graph *graph)
{
	int m, n, w;
	cout << "请输入图的顶点数：";
	cin >> graph->numv;
	cout << "请输入图的边数：";
	cin >> graph->nume;

	graph->array = new AdjList[graph->numv];
	for (int i = 0; i < graph->numv; ++i)
	{
		graph->array[i].head = NULL;	//初始化头结点
	}

	for (int i = 0; i < graph->nume; i++)
	{
		cout << "请输入边(起始点到终止点)：";
		cin >> m >> n;
		cout << "请输入权值：";
		cin >> w;

		AdjListNode *newNode = new AdjListNode;
		assert(newNode);						//判断是否分配到空间
		newNode->num = n;
		newNode->weight = w;               //begin顶点到end顶点的边的权重
		newNode->next = graph->array[m].head;  //新边插入到链表前面
		graph->array[m].head = newNode;

		//无向图需要在<m,n>和<n,m>都建立链接，所以重复上一步
		newNode = new AdjListNode;
		assert(newNode);
		newNode->num = m;
		newNode->weight = w;
		newNode->next = graph->array[n].head;
		graph->array[n].head = newNode;
	}
	return graph;
}
int main()
{
	Graph *graph = new Graph;
	graph = CreateGraph(graph);
    cout << "邻接表输出如下：\n";
	for (int i = 0; i < graph->numv; i++)
	{
		if (NULL == graph->array[i].head)
		{
			cout << i << endl;
		}
		else
		{
			cout << i ;
			AdjListNode * temp = graph->array[i].head;
			for (int j = 0; temp != NULL; j++)
			{
				cout << "->" << temp->num;
				temp = temp->next;
			}
			cout << "\n";
		}
	}
	system("pause");
}