equal
deleted
inserted
replaced
20 /// |
20 /// |
21 /// This demo program shows how to solve a maximum (or maximal) flow |
21 /// This demo program shows how to solve a maximum (or maximal) flow |
22 /// problem using the LEMON LP solver interface. We would like to lay |
22 /// problem using the LEMON LP solver interface. We would like to lay |
23 /// the emphasis on the simplicity of the way one can formulate LP |
23 /// the emphasis on the simplicity of the way one can formulate LP |
24 /// constraints that arise in graph theory in our library LEMON . |
24 /// constraints that arise in graph theory in our library LEMON . |
|
25 /// |
|
26 /// \include lp_maxflow_demo.cc |
25 |
27 |
26 #include<lemon/graph_reader.h> |
28 #include<lemon/graph_reader.h> |
27 #include<lemon/list_graph.h> |
29 #include<lemon/list_graph.h> |
28 #include <lemon/lp.h> |
30 #include <lemon/lp.h> |
29 |
31 |