12.boost有向图无向图(矩阵法)

 #include <iostream>
 #include <boost/config.hpp>
 //图
 #include <boost/graph/adjacency_matrix.hpp>
 #include <boost\graph\graph_utility.hpp>

 using namespace std;
 using namespace boost;

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

 //无向图
 void main1()
 {
     adjacency_matrix<undirectedS> myg(N);
     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);

     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();
 }

 //有向图
 void main2()
 {
     adjacency_matrix<directedS> myg(N);
     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);

     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();
 }