C++算法之prim算法详解的代码

下面的内容是关于C++算法之prim算法详解的内容。

typedef struct _DIR_LINE  
{  
    int start;  
    int end;  
    int weight;  
}DIR_LINE;  
  
typedef struct _MINI_GENERATE_TREE  
{  
    int node_num;  
    int line_num;  
}MINI_GENERATE_TREE; 

b）DIR_LINE的基本操作

{  
  
    if(NULL == ppLine)  
        return FALSE;  
  
        return TRUE;  
    }  
  
    pLine = create_new_dir_line(start, end, weight);  
    return TRUE;  
}  
  
{  
  
        return FALSE;  
  
        goto final;  
    }  
  
    while(pLine != prev->next)  
        prev = prev->next;  
    prev->next = pLine->next;  
  
final:  
    free(pLine);  
    return TRUE;  
}  

C）编写最小生成树，涉及创建、挑选和添加过程

{  
    DIR_LINE pDirLine;  
  
    if(NULL == pGraph || NULL == pGraph->head)  
        return NULL;  
  
    assert(NULL != pMiniTree);  
    memset(pMiniTree, 0, sizeo