从零开始学数据结构系列之第四章《prim算法（普里姆算法）总代码程序进程讲解》

铁匠匠匠

已于 2024-07-24 13:00:03 修改

阅读量885

点赞数 29

分类专栏：数据结构文章标签：笔记数据结构算法学习 c语言经验分享程序人生

于 2024-07-24 02:26:15 首次发布

本文链接：https://blog.csdn.net/qq_62548908/article/details/140648151

版权

数据结构专栏收录该内容

50 篇文章 3 订阅

订阅专栏

文章目录

程序详细进程图
往期回顾

程序详细进程图

#include <stdio.h>
#include <stdlib.h>

/**
 * 图顶点之前不通，那么邻接矩阵的值为MAX
 * 如果顶点是自己本身，那么值为0
 */
#define MAX 32767

typedef struct Graph {
    char* vexs;
    int** arcs;
    int vexNum;
    int arcNum;
}Graph;

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

/**
 * 当edge.weight = 0时，代表顶点加入到U集合中
 */ 
Edge* initEdeg(Graph* G, int index) 
{
	int i=0;
	Edge *T   =	(Edge*)malloc(sizeof(Edge) * G->vexNum);
	printf("initEdeg:\r\n");
	for(i=0;i<G->vexNum;i++)
	{
		T[i].vex = G->vexs[index];
		T[i].weight = G->arcs[index][i];
		printf("T[i].vex->%c, T[i].weight->%d\r\n", T[i].vex,T[i].weight);

	}
	printf("\r\n");
	return T;
}

int getMinEdge(Edge* edge, Graph* G)
{
	int min = MAX;
	int i=0;
	int index=0;
	printf("getMinEdge:\r\n");
	for(i=0;i<G->vexNum;i++)
	{
		if(edge[i].weight && edge[i].weight < min)
		{		
			min = edge[i].weight;
			index = i;
		}
	}
	printf("min:%d ,index:%d ",min,index);
	printf("\r\n");
	return index;
}

void prim(Graph* G, int index) 
{
	int i=0,j=0;
	Edge *edge = initEdeg(G,index);
	int min = 0;

	for(i=0;i<G->vexNum-1;i++)
	{
		printf("现在是第%d次循环：\r\n",i+1);
		min = getMinEdge(edge,G);
		
		printf("v%c --> v%c, weight = %d\n", edge[min].vex, G -> vexs[min], edge[min].weight);
		edge[min].weight = 0;
		for(j=0;j<G->vexNum;j++)
		{
			if(edge[j].weight > G->arcs[min][j] )
			{
				edge[j].weight = G->arcs[min][j];
				edge[j].vex = G->vexs[min];
				printf("edge[j].weight->%d      edge[j].vex->%c\n",edge[j].weight,edge[j].vex);
			}
		}
		printf("循环后的edge.weight的值为%d, %d, %d, %d, %d, %d ：\r\n",edge[0].weight,edge[1].weight,edge[2].weight,edge[3].weight,edge[4].weight,edge[5].weight);
		printf("循环后的edge.vex的值为%c, %c, %c, %c, %c, %c ：\r\n",edge[0].vex,edge[1].vex,edge[2].vex,edge[3].vex,edge[4].vex,edge[5].vex);
		printf("\r\n");
	printf("\r\n");
		
	}


} 

Graph* initGraph(int vexNum) 
{
	int i = 0;
    Graph* G = (Graph*)malloc(sizeof(Graph));
    G -> vexs = (char*)malloc(sizeof(char) * vexNum);
    G -> arcs = (int**)malloc(sizeof(int*) * vexNum);
    for (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) 
{
	int i=0,j=0;

    for (i = 0 ; i < G -> vexNum; i++) 
	{
        G -> vexs[i] = vexs[i];
        for (j = 0; j < G -> vexNum; j++) 
		{
            G -> arcs[i][j] = *(arcs + i * G -> vexNum + j);
            if (G -> arcs[i][j] != 0 && G -> arcs[i][j] != MAX)  
                G -> arcNum ++;
        }
    }
    G -> arcNum /= 2;
}

void DFS(Graph* G, int* visited, int index) 
{
	int i=0;
    printf("%c\t", G -> vexs[index]);
    visited[index] = 1;
    for (i = 0; i < G ->vexNum; i++) 
	{
        if (G -> arcs[index][i] > 0 && G -> arcs[index][i] != MAX && !visited[i]) 
		{
            DFS(G, visited, i);
        }
    }
}

int main() 
{
	int 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
    };
	Graph* G = initGraph(6);
	int* visited = (int*)malloc(sizeof(int) * G -> vexNum);
    
    
    for (i = 0; i < G -> vexNum; i++)
        visited[i] = 0;
    
    createGraph(G, "123456", (int*)arcs);
	printf("DSF:      ");
    DFS(G, visited, 0);
    printf("\n");
	printf("\n");
    prim(G, 0);
    return 0;
}

在这里插入图片描述

输出结果：

DSF:      1     2       3       4       6       5

initEdeg:
T[i].vex->1, T[i].weight->0
T[i].vex->1, T[i].weight->6
T[i].vex->1, T[i].weight->1
T[i].vex->1, T[i].weight->5
T[i].vex->1, T[i].weight->32767
T[i].vex->1, T[i].weight->32767

现在是第1次循环：
getMinEdge:
min:1 ,index:2
v1 --> v3, weight = 1
edge[j].weight->5      edge[j].vex->3
edge[j].weight->6      edge[j].vex->3
edge[j].weight->4      edge[j].vex->3
循环后的edge.weight的值为0, 5, 0, 5, 6, 4 ：
循环后的edge.vex的值为1, 3, 1, 1, 3, 3 ：


现在是第2次循环：
getMinEdge:
min:4 ,index:5
v3 --> v6, weight = 4
edge[j].weight->2      edge[j].vex->6
循环后的edge.weight的值为0, 5, 0, 2, 6, 0 ：
循环后的edge.vex的值为1, 3, 1, 6, 3, 3 ：


现在是第3次循环：
getMinEdge:
min:2 ,index:3
v6 --> v4, weight = 2
循环后的edge.weight的值为0, 5, 0, 0, 6, 0 ：
循环后的edge.vex的值为1, 3, 1, 6, 3, 3 ：


现在是第4次循环：
getMinEdge:
min:5 ,index:1
v3 --> v2, weight = 5
edge[j].weight->3      edge[j].vex->2
循环后的edge.weight的值为0, 0, 0, 0, 3, 0 ：
循环后的edge.vex的值为1, 3, 1, 6, 2, 3 ：


现在是第5次循环：
getMinEdge:
min:3 ,index:4
v2 --> v5, weight = 3
循环后的edge.weight的值为0, 0, 0, 0, 0, 0 ：
循环后的edge.vex的值为1, 3, 1, 6, 2, 3 ：


Press any key to continue