寒假数据结构学习Day17

一些c语言的知识漏洞

在函数传参的时候不能，直接传二维数组，会出现越界访问。正确是先强制转换成一维数组再一一对应赋值。

最小二叉树 （prim）代码实现

#include<stdio.h>
#include<stdlib.h>
#define MAX 32767

typedef struct {     //邻接矩阵的创建
    char* vexs;
    int** arcs;
    int VexNum, arcNum;
}Graph;

typedef struct Edge{
    char vex;
    int weight;
}Edge;


//edge.weight==0时，代表顶点加入U集合

Edge* initEdge(Graph* G, int index) {      //将顶点index放入U集合中去
    Edge* edge = (Edge*)malloc(sizeof(Edge) * G->VexNum);
    for (int i = 0; i < G->VexNum; i++) {
        edge[i].vex = G->vexs[index];
        edge[i].weight = G->arcs[index][i];
    }
    return edge;
}

int getMinEdge(Edge* edge, Graph* G) {    //找到该顶点的最小权
    int index;
    int min = MAX;
    for (int i = 0; i < G->VexNum; i++) {
        if (edge[i].weight != 0 && min > edge[i].weight) {
            min = edge[i].weight;
            index = i;
        }
    }
    return index;
}

void prim(Graph* G, int index) {  //从index这个结点开始
    int min;
    Edge* edge = initEdge(G, index);
    for (int i = 0; i < G->VexNum - 1; i++)\
    {  //边的数量
        min = getMinEdge(edge, G);      //min此时是已经选定的顶点 
        printf("V%c--->V%c,weighht=%d\n", edge[min].vex, G->vexs[min], edge[min].weight);
        edge[min].weight = 0;  //说明该点已经选入U集合中

        for (int j = 0; j < G->VexNum; j++) {
            //把新的结点加入进来 
            if (G->arcs[min][j] < edge[j].weight) {
                edge[j].weight = G->arcs[min][j];
                edge[j].vex = G->vexs[min];
            }

        }

    }
}

Graph* initGraph(int VexNum) {
    Graph* G = (Graph*)malloc(sizeof(Graph));
    G->vexs = (char*)malloc(sizeof(char) * VexNum);
    G->arcs = (int**)malloc(sizeof(int*) * VexNum);
    for (int i = 0; i < VexNum; i++) {
        G->arcs[i] = (int*)malloc(sizeof(int) * VexNum);
    }
    G->VexNum = VexNum;
    G->arcNum = 0;
    return G;
}

void CreateGraph(Graph* G, char* vexs, int** arcs) {
    for (int i = 0; i < G->VexNum; i++) {
        G->vexs[i] = vexs[i];
        for (int j = 0; j < G->VexNum; j++) {
            //G->arcs[i][j] = arcs[i][j];
            //不能直接传二维数组会越界
            G->arcs[i][j] = *(arcs + i * G->VexNum + j);
            if (G->arcs[i][j] != 0)
                G->arcNum++;
        }
    }
    G->arcNum /= 2;
}

int main() {
    Graph* G = initGraph(6);
    int* visited = (int*)malloc(sizeof(int) * G->VexNum);
    for (int i = 0; i < G->VexNum; i++) {
        visited[i] = 0;
    }
    int arcs[6][6] = {
        0,6,1,5,MAX,MAX,
        6,0,5,MAX,3,MAX,
        1,5,0,5,6,4,
        5,MAX,5,0,MAX,2,
        MAX,3,6,MAX,0,6,
        MAX,MAX,4,2,6,0
    };
    CreateGraph(G, "123456", (int*)arcs);
    prim(G, 0);
    return 0;
}