15.boost最小生成树 prim_minimum_spanning_tree

#include <iostream>
#include <boost/config.hpp>
//图(矩阵实现)
#include <boost/graph/adjacency_matrix.hpp>
#include <boostgraphgraph_utility.hpp>
#include <boost/graph/graph_traits.hpp>
//图(链表实现)
#include <boost/graph/adjacency_list.hpp>
//求最小生成树
#include <boost/graph/kruskal_min_spanning_tree.hpp>
//prim算法求最小生成树
#include <boost/graph/prim_minimum_spanning_tree.hpp>
using namespace std;
using namespace boost;

//顶点名称
enum { A, B, C, D, E, F };
//顶点个数
#define N 6
const char *name = "ABCDEF";

//无向图
void main()
{
    //图,每个结点是vec来实现,无向图,有边长与权重的属性
    adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, int>> myg;
    add_edge(A, B,13, myg);
    add_edge(B, C,23 ,myg);
    add_edge(A, C,1, myg);
    add_edge(A, D,11, myg);
    add_edge(C, D,10, myg);
    add_edge(B, D,11, myg);

    //定义图的类型
    typedef adjacency_list<vecS, vecS, undirectedS, property<edge_weight_t, int>> mygraph;

    //创建边与权重的映射(weight是函数指针)
    auto weight= get(edge_weight,myg);
    //property_map<mygraph, edge_weight_t>::type weight = get(edge_weight, myg);

    //vector数组,存放四个顶点
    vector<graph_traits<mygraph>::vertex_descriptor> pv(4);

    //将最小生成树的结果插到vector中
    prim_minimum_spanning_tree(myg, &pv[0]);

    //输出
    for (int i = 0; i < pv.size(); i++)
    {
        if (pv[i] != i)
        {
            graph_traits<mygraph>::edge_descriptor ed;
            bool isok;
            //生成绑定
            tie(ed, isok) = edge(i, pv[i], myg);
            cout << "tree" << i << "<--->" << pv[i] << "   " << weight[ed] << endl;
        }
    }
    
    cin.get();
}