COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/lemon/suurballe.h @ 1019:ee01de62188d

Last change on this file since 1019:ee01de62188d was 987:87f7c54892df, checked in by Alpar Juttner, 16 years ago

Naming changes:

File size: 6.3 KB
RevLine 
[906]1/* -*- C++ -*-
[921]2 * src/lemon/suurballe.h - Part of LEMON, a generic C++ optimization library
[906]3 *
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Combinatorial Optimization Research Group, EGRES).
6 *
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
10 *
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
13 * purpose.
14 *
15 */
16
[921]17#ifndef LEMON_SUURBALLE_H
18#define LEMON_SUURBALLE_H
[899]19
20///\ingroup flowalgs
21///\file
22///\brief An algorithm for finding k paths of minimal total length.
23
24
[921]25#include <lemon/maps.h>
[899]26#include <vector>
[921]27#include <lemon/min_cost_flow.h>
[899]28
[921]29namespace lemon {
[899]30
31/// \addtogroup flowalgs
32/// @{
33
34  ///\brief Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes
35  /// of minimal total length
36  ///
[921]37  /// The class \ref lemon::Suurballe implements
[899]38  /// an algorithm for finding k edge-disjoint paths
39  /// from a given source node to a given target node in an
40  /// edge-weighted directed graph having minimal total weight (length).
41  ///
42  ///\warning Length values should be nonnegative.
43  ///
44  ///\param Graph The directed graph type the algorithm runs on.
45  ///\param LengthMap The type of the length map (values should be nonnegative).
46  ///
[968]47  ///\note It it questionable whether it is correct to call this method after
[899]48  ///%Suurballe for it is just a special case of Edmond's and Karp's algorithm
[968]49  ///for finding minimum cost flows. In fact, this implementation just
[899]50  ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and
51  ///Edmonds-Karp published in 1972, therefore it is possibly right to
52  ///state that they are
53  ///independent results. Most frequently this special case is referred as
54  ///%Suurballe method in the literature, especially in communication
55  ///network context.
56  ///\author Attila Bernath
57  template <typename Graph, typename LengthMap>
58  class Suurballe{
59
60
[987]61    typedef typename LengthMap::Value Length;
[899]62   
63    typedef typename Graph::Node Node;
64    typedef typename Graph::NodeIt NodeIt;
65    typedef typename Graph::Edge Edge;
66    typedef typename Graph::OutEdgeIt OutEdgeIt;
67    typedef typename Graph::template EdgeMap<int> EdgeIntMap;
68
69    typedef ConstMap<Edge,int> ConstMap;
70
71    const Graph& G;
72
[941]73    Node s;
74    Node t;
75
[899]76    //Auxiliary variables
77    //This is the capacity map for the mincostflow problem
78    ConstMap const1map;
79    //This MinCostFlow instance will actually solve the problem
[941]80    MinCostFlow<Graph, LengthMap, ConstMap> min_cost_flow;
[899]81
82    //Container to store found paths
83    std::vector< std::vector<Edge> > paths;
84
85  public :
86
87
[941]88    /*! \brief The constructor of the class.
[899]89   
[941]90    \param _G The directed graph the algorithm runs on.
91    \param _length The length (weight or cost) of the edges.
92    \param _s Source node.
93    \param _t Target node.
94    */
95    Suurballe(Graph& _G, LengthMap& _length, Node _s, Node _t) :
96      G(_G), s(_s), t(_t), const1map(1),
97      min_cost_flow(_G, _length, const1map, _s, _t) { }
[899]98
99    ///Runs the algorithm.
100
101    ///Runs the algorithm.
102    ///Returns k if there are at least k edge-disjoint paths from s to t.
[941]103    ///Otherwise it returns the number of edge-disjoint paths found
104    ///from s to t.
[899]105    ///
106    ///\param k How many paths are we looking for?
107    ///
[941]108    int run(int k) {
109      int i = min_cost_flow.run(k);
[899]110
111      //Let's find the paths
112      //We put the paths into stl vectors (as an inner representation).
113      //In the meantime we lose the information stored in 'reversed'.
114      //We suppose the lengths to be positive now.
115
[941]116      //We don't want to change the flow of min_cost_flow, so we make a copy
[899]117      //The name here suggests that the flow has only 0/1 values.
118      EdgeIntMap reversed(G);
119
120      for(typename Graph::EdgeIt e(G); e!=INVALID; ++e)
[941]121        reversed[e] = min_cost_flow.getFlow()[e];
[899]122     
123      paths.clear();
124      //total_length=0;
125      paths.resize(k);
126      for (int j=0; j<i; ++j){
127        Node n=s;
128
129        while (n!=t){
130
[946]131          OutEdgeIt e(G, n);
[899]132         
133          while (!reversed[e]){
134            ++e;
135          }
[986]136          n = G.target(e);
[899]137          paths[j].push_back(e);
138          //total_length += length[e];
139          reversed[e] = 1-reversed[e];
140        }
141       
142      }
143      return i;
144    }
145
146   
[941]147    ///Returns the total length of the paths.
[899]148   
149    ///This function gives back the total length of the found paths.
150    Length totalLength(){
[941]151      return min_cost_flow.totalLength();
[899]152    }
153
154    ///Returns the found flow.
155
156    ///This function returns a const reference to the EdgeMap \c flow.
[941]157    const EdgeIntMap &getFlow() const { return min_cost_flow.flow;}
[899]158
159    /// Returns the optimal dual solution
160   
161    ///This function returns a const reference to the NodeMap
162    ///\c potential (the dual solution).
[941]163    const EdgeIntMap &getPotential() const { return min_cost_flow.potential;}
[899]164
165    ///Checks whether the complementary slackness holds.
166
167    ///This function checks, whether the given solution is optimal.
168    ///Currently this function only checks optimality,
169    ///doesn't bother with feasibility
170    ///It is meant for testing purposes.
171    bool checkComplementarySlackness(){
[941]172      return min_cost_flow.checkComplementarySlackness();
[899]173    }
174
175    ///Read the found paths.
176   
177    ///This function gives back the \c j-th path in argument p.
178    ///Assumes that \c run() has been run and nothing changed since then.
179    /// \warning It is assumed that \c p is constructed to
180    ///be a path of graph \c G.
181    ///If \c j is not less than the result of previous \c run,
182    ///then the result here will be an empty path (\c j can be 0 as well).
183    ///
[921]184    ///\param Path The type of the path structure to put the result to (must meet lemon path concept).
[899]185    ///\param p The path to put the result to
186    ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively)
187    template<typename Path>
188    void getPath(Path& p, size_t j){
189
190      p.clear();
191      if (j>paths.size()-1){
192        return;
193      }
194      typename Path::Builder B(p);
195      for(typename std::vector<Edge>::iterator i=paths[j].begin();
196          i!=paths[j].end(); ++i ){
197        B.pushBack(*i);
198      }
199
200      B.commit();
201    }
202
203  }; //class Suurballe
204
205  ///@}
206
[921]207} //namespace lemon
[899]208
[921]209#endif //LEMON_SUURBALLE_H
Note: See TracBrowser for help on using the repository browser.