equal
deleted
inserted
replaced
21 ///\file |
21 ///\file |
22 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost |
22 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost |
23 |
23 |
24 |
24 |
25 #include <lemon/dijkstra.h> |
25 #include <lemon/dijkstra.h> |
26 #include <lemon/graph_wrapper.h> |
26 #include <lemon/graph_adaptor.h> |
27 #include <lemon/maps.h> |
27 #include <lemon/maps.h> |
28 #include <vector> |
28 #include <vector> |
29 |
29 |
30 namespace lemon { |
30 namespace lemon { |
31 |
31 |
66 typedef typename Graph::NodeIt NodeIt; |
66 typedef typename Graph::NodeIt NodeIt; |
67 typedef typename Graph::Edge Edge; |
67 typedef typename Graph::Edge Edge; |
68 typedef typename Graph::OutEdgeIt OutEdgeIt; |
68 typedef typename Graph::OutEdgeIt OutEdgeIt; |
69 typedef typename Graph::template EdgeMap<int> EdgeIntMap; |
69 typedef typename Graph::template EdgeMap<int> EdgeIntMap; |
70 |
70 |
71 typedef ResGraphWrapper<const Graph,int,CapacityMap,EdgeIntMap> ResGW; |
71 typedef ResGraphAdaptor<const Graph,int,CapacityMap,EdgeIntMap> ResGW; |
72 typedef typename ResGW::Edge ResGraphEdge; |
72 typedef typename ResGW::Edge ResGraphEdge; |
73 |
73 |
74 protected: |
74 protected: |
75 |
75 |
76 const Graph& g; |
76 const Graph& g; |