数据结构第十七次作业：Prim算法和Dijkstra算法

       Prim算法用于在带权无向图中找出最小生成树。最小生成树是连接图中所有顶点的树，其所有边的权值之和最小。

       Dijkstra算法用于在带权有向图中，从指定的源点到其他所有顶点的最短路径。注意，Dijkstra算法不能用于含有负权边的图。

#include<iostream>
using namespace std;

#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;
}

//dijkstra求最短路
int dijkstraOrPrim(NetPtr paraPtr, int paraAlgorithm) {
	int i, j, minDistance, tempBestNode, resultCost=0;
	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;
}

 

end