equal
deleted
inserted
replaced
8 |
8 |
9 using namespace hugo; |
9 using namespace hugo; |
10 |
10 |
11 // Use a DIMACS max flow file as stdin. |
11 // Use a DIMACS max flow file as stdin. |
12 // read_dimacs_demo < dimacs_max_flow_file |
12 // read_dimacs_demo < dimacs_max_flow_file |
|
13 |
|
14 /* |
|
15 struct Ize { |
|
16 }; |
|
17 |
|
18 struct Mize { |
|
19 Ize bumm; |
|
20 }; |
|
21 |
|
22 template <typename B> |
|
23 class Huha { |
|
24 public: |
|
25 int u; |
|
26 B brr; |
|
27 }; |
|
28 */ |
|
29 |
13 int main(int, char **) { |
30 int main(int, char **) { |
14 typedef ListGraph::NodeIt NodeIt; |
31 typedef ListGraph::NodeIt NodeIt; |
15 typedef ListGraph::EachEdgeIt EachEdgeIt; |
32 typedef ListGraph::EachEdgeIt EachEdgeIt; |
|
33 |
|
34 /* |
|
35 Mize mize[10]; |
|
36 Mize bize[0]; |
|
37 Mize zize; |
|
38 typedef Mize Tize[0]; |
|
39 |
|
40 std::cout << &zize << " " << sizeof(mize) << sizeof(Tize) << std::endl; |
|
41 std::cout << sizeof(bize) << std::endl; |
|
42 |
|
43 |
|
44 Huha<Tize> k; |
|
45 std::cout << sizeof(k) << std::endl; |
|
46 */ |
16 |
47 |
17 ListGraph G; |
48 ListGraph G; |
18 NodeIt s, t; |
49 NodeIt s, t; |
19 ListGraph::EdgeMap<int> cap(G); |
50 ListGraph::EdgeMap<int> cap(G); |
20 readDimacsMaxFlow(std::cin, G, s, t, cap); |
51 readDimacsMaxFlow(std::cin, G, s, t, cap); |