18.boost 图的拓扑排序

运行结果:

代码示例:

 #include <iostream>
 #include <vector>
 #include <deque>
 #include <boost/config.hpp>
 #include <boost/graph/adjacency_matrix.hpp>
 #include <boost/graph/graph_utility.hpp>//打印顶点,边长
 #include <boost/graph/adjacency_list.hpp>
 //拓扑排序
 #include <boost/graph/topological_sort.hpp>

 using namespace std;
 using namespace boost;

 void main()
 {
     vector<string> task;
     task.push_back("幼儿园接小孩");
     task.push_back("买菜");
     task.push_back("去ATM取钱");
     task.push_back("送孩子去看书");
     task.push_back("煮饭");
     task.push_back("去图书馆接孩子");
     task.push_back("吃饭");

     typedef pair<int, int>pint;
     pint ea[] = { pint(,),pint(,),pint(,), pint(,), pint(,), pint(,), pint(,) };
     //初始化
     vector<pint> myv(ea, ea + );
     //生成图
     adjacency_list<listS, vecS, directedS> myg(myv.begin(), myv.end(), myv.size());

     deque<int> top_order;
     //拓扑排序
     topological_sort(myg, front_inserter(top_order), vertex_index_map(identity_property_map()));
     for (auto ib = top_order.begin(); ib != top_order.end(); ib++)
     {
         cout << task[*ib] << endl;
     }
     cin.get();
 }