Prim 算法与 Dijkstra 算法

代码

#include <stdio.h>
#include <malloc.h>

#define MAX_DISTANCE 10000

typedef struct Net {
	int** weights;
	int numNodes;
} Net, * NetPtr;

NetPtr initNet(int paraSize, int** paraData) {
	int i, j;
	NetPtr resultPtr = (NetPtr)malloc(sizeof(Net));
	resultPtr->numNodes = paraSize;

	resultPtr->weights = (int**)malloc(paraSize * sizeof(int*));
	for (i = 0; i < paraSize; i++) {
		resultPtr->weights[i] = (int*)malloc(paraSize * sizeof(int));
		for (j = 0; j < paraSize; j++) {
			resultPtr->weights[i][j] = paraData[i][j];
		}
	}

	return resultPtr;
}

int dijkstraOrPrim(NetPtr paraPtr, int paraAlgorithm) {
	int i, j, minDistance, tempBestNode, resultCost;
	int source = 0;
	int numNodes = paraPtr->numNodes;
	int* distanceArray = (int*)malloc(numNodes * sizeof(int));
	int* parentArray = (int*)malloc(numNodes * sizeof(int));
	int* visitedArray = (int*)malloc(numNodes * sizeof(int));

	for (i = 0; i < numNodes; i++) {
		distanceArray[i] = paraPtr->weights[source][i];
		parentArray[i] = source;
		visitedArray[i] = 0;
	}
	distanceArray[source] = 0;
	parentArray[source] = -1;
	visitedArray[source] = 1;

	tempBestNode = -1;
	for (i = 0; i < numNodes - 1; i++) {
		minDistance = MAX_DISTANCE;
		for (j = 0; j < numNodes; j++) {
			if (visitedArray[j]) {
				continue;
			}

			if (minDistance > distanceArray[j]) {
				minDistance = distanceArray[j];
				tempBestNode = j;
			}
		} 

		visitedArray[tempBestNode] = 1;

		for (j = 0; j < numNodes; j++) {
			if (visitedArray[j]) {
				continue;
			}

			if (paraPtr->weights[tempBestNode][j] >= MAX_DISTANCE) {
				continue;
			}

			if (paraAlgorithm == 0) {
				if (distanceArray[j] > distanceArray[tempBestNode] + paraPtr->weights[tempBestNode][j]) {
					distanceArray[j] = distanceArray[tempBestNode] + paraPtr->weights[tempBestNode][j];
					parentArray[j] = tempBestNode;
				} 
			}
			else {
				if (distanceArray[j] > paraPtr->weights[tempBestNode][j]) {
					distanceArray[j] = paraPtr->weights[tempBestNode][j];
					parentArray[j] = tempBestNode;
				} 
			}
		} 
	} 

	printf("the parent of each node: ");
	for (i = 0; i < numNodes; i++) {
		printf("%d, ", parentArray[i]);
	}

	if (paraAlgorithm == 0) {
		printf("From node 0, path length to all nodes are: ");
		for (i = 0; i < numNodes; i++) {
			printf("%d (%d), ", i, distanceArray[i]);
		}
	}
	else {
		resultCost = 0;
		for (i = 0; i < numNodes; i++) {
			resultCost += distanceArray[i];
			printf("cost of node %d is %d, total = %d\r\n", i, distanceArray[i], resultCost);
		}
		printf("Finally, the total cost is %d.\r\n ", resultCost);
	}

	printf("\r\n");

	return resultCost;
}

NetPtr constructSampleNet() {
	int i, j;
	int myGraph[6][6] = {
		{0, 6, 1, 5, 0, 0},
		{6, 0, 5, 0, 3, 0},
		{1, 5, 0, 5, 6, 4},
		{5, 0, 5, 0, 0, 2},
		{0, 3, 6, 0, 0, 6},
		{0, 0, 4, 2, 6, 0} };
	int** tempPtr;
	int numNodes = 6;
	printf("Preparing data\r\n");

	tempPtr = (int**)malloc(numNodes * sizeof(int*));
	for (i = 0; i < numNodes; i++) {
		tempPtr[i] = (int*)malloc(numNodes * sizeof(int));
	}

	for (i = 0; i < numNodes; i++) {
		for (j = 0; j < numNodes; j++) {
			if (myGraph[i][j] == 0) {
				tempPtr[i][j] = MAX_DISTANCE;
			}
			else {
				tempPtr[i][j] = myGraph[i][j];
			}
		}
	}

	printf("Data ready\r\n");

	NetPtr resultNetPtr = initNet(numNodes, tempPtr);
	return resultNetPtr;
}
void testPrim() {
	NetPtr tempNetPtr = constructSampleNet();
	printf("=====Dijkstra algorithm=====\r\n");
	dijkstraOrPrim(tempNetPtr, 0);
	printf("=====Prim algorithm=====\r\n");
	dijkstraOrPrim(tempNetPtr, 1);
}

int main() {
	testPrim();
	return 1;
}

运行结果

Preparing data
Data ready
=====Dijkstra algorithm=====
the parent of each node: -1, 0, 0, 0, 2, 2, From node 0, path length to all nodes are: 0 (0), 1 (6), 2 (1), 3 (5), 4 (7), 5 (5),
=====Prim algorithm=====
the parent of each node: -1, 2, 0, 5, 1, 2, cost of node 0 is 0, total = 0
cost of node 1 is 5, total = 5
cost of node 2 is 1, total = 6
cost of node 3 is 2, total = 8
cost of node 4 is 3, total = 11
cost of node 5 is 4, total = 15
Finally, the total cost is 15.

代码说明

Prim 算法用于解决最小生成树问题，而 Dijkstra 算法用于解决单源最短路径问题

1.在typedef中，weights是个指向整数指针的指针，即二维整数数组，numNodes表示网络中的节点数量

2. initNet 函数初始化矩阵

3. dijkstraOrPrim函数中distanceArray（存储从源点到每个节点的最短距离）、parentArray（存储到达每个节点的最短路径的父节点）和visitedArray（标记节点是否已被访问）。