原贴地址:http://blog.csdn.net/feixiaoxing/article/details/6978095
【 声明:版权所有,欢迎转载,请勿用于商业用途。 联系信箱:feixiaoxing @163.com】
前面在讨论克鲁斯卡尔的算法的时候,我们分析了算法的基本过程、基本数据结构和算法中需要解决的三个问题(排序、判断、合并)。今天,我们继续完成剩下部分的内容。合并函数中,我们调用了两个基本函数,find_tree_by_index和delete_mini_tree_from_group,下面给出详细的计算过程。
- MINI_GENERATE_TREE* find_tree_by_index(MINI_GENERATE_TREE* pTree[], int length, int point)
- {
- int outer;
- int inner;
- for(outer = 0; outer < length; outer++){
- for(inner = 0; inner < pTree[outer]->node_num; inner ++){
- if(point == pTree[outer]->pNode[inner])
- return pTree[outer];
- }
- }
- return NULL;
- }
- void delete_mini_tree_from_group(MINI_GENERATE_TREE* pTree[], int length, MINI_GENERATE_TREE* pIndex)
- {
- int index;
- for(index = 0; index < length; index ++){
- if(pIndex == pTree[index])
- break;
- }
- memmove(&pTree[index +1], &pTree[index], sizeof(MINI_GENERATE_TREE*) * (length -1 - index));
- return;
- }
- MINI_GENERATE_TREE* _kruskal(MINI_GENERATE_TREE* pTree[], int length, DIR_LINE* pLine[], int number)
- {
- int index;
- if(NULL == pTree || NULL == pLine)
- return NULL;
- for(index = 0; index < number; index ++){
- bubble_sort((void**)pLine, number, compare, swap);
- if(2 == isDoubleVectexExistInTree(pTree, length, pLine[index]->start, pLine[index]->end))
- continue;
- mergeTwoMiniGenerateTree(pTree, length, pLine[index]->start, pLine[index]->end, pLine[index]->weight);
- length --;
- }
- return (1 != length) ? NULL : pTree[0];
- }
- MINI_GENERATE_TREE* kruskal(GRAPH* pGraph)
- {
- MINI_GENERATE_TREE** pTree;
- DIR_LINE** pLine;
- int count;
- int number;
- if(NULL == pGraph)
- return NULL;
- count = pGraph->count;
- number = get_total_line_number(pGraph);
- pTree = get_tree_from_graph(pGraph);
- pLine = get_line_from_graph(pGraph);
- return _kruskal(pTree, count, pLine, number);
- }
总结:
(1)代码中没有考虑内存的释放问题,需要改进和提高
(2)部分代码可以复用prim算法中的内容,数据结构也一样
(3)算法的编写贵在理解,只要步骤对了,再加上测试,一般问题都不大