equal
deleted
inserted
replaced
33 |
33 |
34 int main(int, char **) { |
34 int main(int, char **) { |
35 |
35 |
36 typedef ListGraph MutableGraph; |
36 typedef ListGraph MutableGraph; |
37 |
37 |
38 typedef SmartGraph Graph; |
38 // typedef SmartGraph Graph; |
39 //typedef ListGraph Graph; |
39 typedef ListGraph Graph; |
40 typedef Graph::Node Node; |
40 typedef Graph::Node Node; |
41 typedef Graph::EdgeIt EdgeIt; |
41 typedef Graph::EdgeIt EdgeIt; |
42 |
42 |
43 |
43 |
44 // Mize mize[10]; |
44 // Mize mize[10]; |
64 |
64 |
65 Graph G; |
65 Graph G; |
66 Node s, t; |
66 Node s, t; |
67 Graph::EdgeMap<int> cap(G); |
67 Graph::EdgeMap<int> cap(G); |
68 readDimacsMaxFlow(std::cin, G, s, t, cap); |
68 readDimacsMaxFlow(std::cin, G, s, t, cap); |
69 |
|
70 // typedef TrivGraphWrapper<Graph> TGW; |
|
71 // TGW gw(G); |
|
72 // TGW::NodeIt sw; |
|
73 // gw./*getF*/first(sw); |
|
74 // std::cout << "p1:" << gw.nodeNum() << std::endl; |
|
75 // gw.erase(sw); |
|
76 // std::cout << "p2:" << gw.nodeNum() << std::endl; |
|
77 |
|
78 // typedef const Graph cLG; |
|
79 // typedef TrivGraphWrapper<const cLG> CTGW; |
|
80 // CTGW cgw(G); |
|
81 // CTGW::NodeIt csw; |
|
82 // cgw./*getF*/first(csw); |
|
83 // std::cout << "p1:" << cgw.nodeNum() << std::endl; |
|
84 // //cgw.erase(csw); |
|
85 // std::cout << "p2:" << cgw.nodeNum() << std::endl; |
|
86 |
69 |
87 { |
70 { |
88 std::cout << "preflow ..." << std::endl; |
71 std::cout << "preflow ..." << std::endl; |
89 Graph::EdgeMap<int> flow(G); //0 flow |
72 Graph::EdgeMap<int> flow(G); //0 flow |
90 |
73 |