图邻接矩阵的c语言实现 graph_adj_matrix.cpp

gra_adj_matrix.cpp 文件

#include <iostream>
#include <stdlib.h>
#include <limits.h>
using namespace std;

#define  Vertex_MAX 15
#define  Edge_MAX 15*(15-1)
typedef int elemtype;
//typedef float elemtype;
int Vertex_n = 0;
int Edge_n = 0;

struct graph
{
    elemtype V[Vertex_MAX+1];   //顶点
    elemtype arcs[Vertex_MAX+1][Vertex_MAX+1];  //边(i,j)
};

//访问标志位
char visited[Vertex_MAX+1] = {
  0};

//建立无向图邻接矩阵
void UDcreatadj_matrix(graph& g)
{
    int i,j,k;
    //输入顶点个数和边的个数
    printf("请输入顶点个数：");
    cin>>Vertex_n;
    printf("请输入边的个数：");
    cin>>Edge_n;
    //输入顶点信息
    for (k = 1; k <= Vertex_n; k++) 
    {  
        printf("请输入%d个顶点,第%d个顶点: ",Vertex_n,k);
        cin>>g.V[k];
    }
    //矩阵初始化
    for (i = 1; i <= Vertex_n; i ++)
    {
        for (j = 1; j <= Vertex_n; j++ )
        {
            g.arcs[i][j] = 0;