boost 最大流求解示例
2015-09-16 14:40
447 查看
#include <iostream> #include <boost/config.hpp> #include <boost/graph/boykov_kolmogorov_max_flow.hpp> #include <boost/graph/push_relabel_max_flow.hpp> #include <boost/graph/edmonds_karp_max_flow.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/read_dimacs.hpp> #include <boost/graph/graph_utility.hpp> /* , boost::property <boost::vertex_color_t, boost::default_color_type, boost::property <boost::vertex_distance_t, long, boost::property <boost::vertex_predecessor_t, Traits::edge_descriptor > > > */ typedef boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS> Traits; typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, boost::property < boost::vertex_name_t, std::pair<int,int>, boost::property < boost::vertex_color_t, boost::default_color_type, boost::property < boost::vertex_distance_t, long, boost::property < boost::vertex_predecessor_t, Traits::edge_descriptor > > > >, boost::property < boost::edge_capacity_t, double, boost::property < boost::edge_residual_capacity_t, double, boost::property < boost::edge_reverse_t, Traits::edge_descriptor> > > > Graph; void AddEdge( Traits::vertex_descriptor &v1, Traits::vertex_descriptor &v2, boost::property_map < Graph, boost::edge_reverse_t >::type &rev, const double capacity, Graph &g) { Traits::edge_descriptor e1 = boost::add_edge(v1, v2, g).first; Traits::edge_descriptor e2 = boost::add_edge(v2, v1, g).first; boost::put(boost::edge_capacity, g, e1, capacity); boost::put(boost::edge_capacity, g, e2, capacity); rev[e1] = e2; rev[e2] = e1; } int main(int argc, char* argv[]) { Graph g; boost::property_map < Graph, boost::edge_reverse_t >::type rev = get(boost::edge_reverse, g); std::pair<int, int> point1(0, 0); std::pair<int, int> point2(1, 0); std::pair<int, int> point3(1, 1); std::pair<int, int> point4(0, 1); Graph::vertex_descriptor u = boost::add_vertex(point1, g); Graph::vertex_descriptor v = boost::add_vertex(point2, g); Graph::vertex_descriptor w = boost::add_vertex(point3, g); Graph::vertex_descriptor x = boost::add_vertex(point4, g); //boost::add_edge(u, v, g); AddEdge(u, v, rev, 10.1, g); AddEdge(u, w, rev, 10.2, g); AddEdge(v, x, rev, 8.1, g); AddEdge(w, x, rev, 6.2, g); //double flow = boost::boykov_kolmogorov_max_flow(g, u, x); //double flow = boost::push_relabel_max_flow(g, u, x); double flow = boost::edmonds_karp_max_flow(g, u, x); boost::property_map < Graph, boost::vertex_color_t >::type vertex_color = get(boost::vertex_color, g); boost::graph_traits < Graph >::vertex_iterator u_iter, u_end; for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { std::cout << "ver: " << *u_iter << " " << vertex_color[*u_iter] << std::endl; } return 0; }
开头先以代码给大家,使用boost库进行最大流的求解。
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- boost相关小知识(长期顶置更新)
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C++联合体转换成C#结构的实现方法
- C++编写简单的打靶游戏
- C++ 自定义控件的移植问题
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- 使用Lua来扩展C++程序的方法
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例
- C与C++之间相互调用实例方法讲解
- C++ Custom Control控件向父窗体发送对应的消息