【算法与数据结构】图 -- 数组表示法

//图的数组表示法

//最大顶点个数
const int MAX_VERTEX = 100;

//最大值
const int MAX_VALUE = (1 << 31) - 1;

typedef struct _tagArcCell
{
    int   adj;        //无向网，权值
    char  character;  //顶点信息，字符
}ArcCell, ArcCell_ARRAY[MAX_VERTEX][MAX_VERTEX];

 

typedef struct _tagGraph 
{
    char vexs[MAX_VERTEX];       //顶点向量
    ArcCell_ARRAY arcCellArray;  //节点数组
    int nodeNum;                 //顶点数
    int edgeNum;                 //边数
}Graph;

//根据点，获取该点在图中的位置
int Locate(Graph& graph, char ch)
{
    for (int i = 0; i < graph.nodeNum; ++ i)
    {
        if (ch == graph.vexs[i])
        {
            return i;
        }
    }
    
    return -1;
}

void CreateGraph(Graph& graph)
{
    //初始化无向网的值
    int num = 0;

    cout << "请输入图的顶点个数"; 
    cin >> num;
    graph.nodeNum = num;

    cout << "请输入图的边数";
    cin >> num;
    graph.edgeNum = num; 

    cout << endl<<endl;
    cout<<"下面开始构造顶点向量"<<endl;

    for (int i = 0; i < graph.nodeNum; ++ i)
    {
        cout << "请输入每个顶点:";
        char ch = 0;
        cin >> ch;
        graph.vexs[i] = ch;
    }
    cout << "\r\n顶点向量构造完毕\r\n\r\n";


    cout << "下面开始初始化邻接矩阵\r\n";
    for (int i = 0; i < graph.nodeNum; ++ i)
    {
        for (int j = 0; j < graph.nodeNum; ++ j)
        {
            graph.arcCellArray[i][j].adj = MAX_VALUE;
        }
    }

    cout << "\r\n邻接矩阵初始化完毕\r\n\r\n";

    cout << "下面开始构造边，并为边分配权值\r\n";
    for (int i = 0; i < graph.edgeNum; ++ i)
    {
        cout << "请先输入一个顶点:";
        char ch = 0;
        cin >> ch;
        int nFrom = Locate(graph, ch);
        if (-1 == nFrom)
        {
            cout << "您输入的顶点不在此图上，请重新输入\r\n";
            -- i;
            continue;
        }
        cout << "请输入另一个顶点:";
        cin >> ch;
        int nTo = Locate(graph, ch);
        if (-1 == nTo)
        {
            cout << "您输入的顶点不在此图上，请重新输入本条边\r\n";
            -- i;
            continue;
        }

        int adj = 0; 
        cout << "请输入该边的权值:";
        cin >> adj;
        graph.arcCellArray[nFrom][nTo].adj = graph.arcCellArray[nTo][nFrom].adj = adj;
    }
    
    cout <<endl<< "构造边和权值结束"<<endl<<endl; 

}

int _tmain(int argc, _TCHAR* argv[])
{
    Graph graph;
    CreateGraph(graph);

    return 0;
}