equal
deleted
inserted
replaced
6 #include <iterator> |
6 #include <iterator> |
7 |
7 |
8 #include <bfs_iterator.hh> |
8 #include <bfs_iterator.hh> |
9 #include <time_measure.h> |
9 #include <time_measure.h> |
10 |
10 |
11 namespace marci { |
11 namespace hugo { |
12 |
12 |
13 template<typename Graph, typename Number, typename FlowMap, typename CapacityMap> |
13 template<typename Graph, typename Number, typename FlowMap, typename CapacityMap> |
14 class ResGraph { |
14 class ResGraph { |
15 typedef typename Graph::NodeIt NodeIt; |
15 typedef typename Graph::NodeIt NodeIt; |
16 typedef typename Graph::EachNodeIt EachNodeIt; |
16 typedef typename Graph::EachNodeIt EachNodeIt; |
538 //NodeMap(const Graph& _G, T a) : |
538 //NodeMap(const Graph& _G, T a) : |
539 // G(_G), container(G.node_id, a) { } |
539 // G(_G), container(G.node_id, a) { } |
540 //FIXME |
540 //FIXME |
541 void set(NodeIt nit, T a) { container[G.id(nit)]=a; } |
541 void set(NodeIt nit, T a) { container[G.id(nit)]=a; } |
542 T get(NodeIt nit) const { return container[G.id(nit)]; } |
542 T get(NodeIt nit) const { return container[G.id(nit)]; } |
543 //void resize() { container.resize(G.node_id); } |
543 //void update() { container.resize(G.node_id); } |
544 //void resize(T a) { container.resize(G.node_id, a); } |
544 //void update(T a) { container.resize(G.node_id, a); } |
545 }; |
545 }; |
546 */ |
546 */ |
547 |
547 |
548 |
548 |
549 template <typename Graph, typename Number, typename FlowMap, typename CapacityMap> |
549 template <typename Graph, typename Number, typename FlowMap, typename CapacityMap> |
644 } |
644 } |
645 }; |
645 }; |
646 |
646 |
647 |
647 |
648 |
648 |
649 } // namespace marci |
649 } // namespace hugo |
650 |
650 |
651 #endif //EDMONDS_KARP_HH |
651 #endif //EDMONDS_KARP_HH |