13.boost有向无向图邻接表表示

#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>
using namespace std;
using namespace boost;

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

//无向图
void main()
{
    //vecS是vector数组的意思(每一个结点都是一个vector数组)
    adjacency_list<vecS, vecS, undirectedS> myg(N);
    //每一个结点都是list
    //adjacency_list<listS, listS, undirectedS> myg;
    //每一个结点都是set(红黑树)
    //adjacency_list<setS, setS, undirectedS> myg;
    //每一个结点都是multiset(红黑树,每一个结点是一个链表)
    //adjacency_list<multisetS, multisetS, undirectedS> myg(5);

    add_edge(A, B, myg);
    add_edge(A, C, myg);
    add_edge(A, D, myg);
    add_edge(A, E, myg);
    add_edge(B, C, myg);
    add_edge(F, C, myg);

    //输出所有结点
    auto it = vertices(myg);
    for (auto ib = it.first; ib != it.second; ib++)
    {
        cout << *ib << endl;
    }

    //输出所有边
    auto ite = edges(myg);
    for (auto ib = ite.first; ib != ite.second; ib++)
    {
        //cout << *ib << endl;
        //输出从哪到哪
        cout << source(*ib, myg) << "->" << target(*ib, myg) << endl;
    }


    cout << "顶点" << endl;
    print_vertices(myg, name);
    cout << endl;

    cout << "边" << endl;
    print_edges(myg, name);
    cout << endl;

    cout << "关联" << endl;
    print_graph(myg, name);
    cout << endl;
    cin.get();
}