Changeset 606:c5fd2d996909 in lemon for lemon/suurballe.h
 Timestamp:
 03/29/09 23:08:20 (11 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/suurballe.h
r566 r606 46 46 /// \ref CapacityScaling "successive shortest path" algorithm. 47 47 /// 48 /// \tparam DigraphThe digraph type the algorithm runs on.48 /// \tparam GR The digraph type the algorithm runs on. 49 49 /// The default value is \c ListDigraph. 50 /// \tparam L engthMapThe type of the length (cost) map.50 /// \tparam LEN The type of the length (cost) map. 51 51 /// The default value is <tt>Digraph::ArcMap<int></tt>. 52 52 /// … … 56 56 /// with \ref SplitNodes. 57 57 #ifdef DOXYGEN 58 template <typename Digraph, typename LengthMap>58 template <typename GR, typename LEN> 59 59 #else 60 template < typename Digraph= ListDigraph,61 typename L engthMap = typename Digraph::template ArcMap<int> >60 template < typename GR = ListDigraph, 61 typename LEN = typename GR::template ArcMap<int> > 62 62 #endif 63 63 class Suurballe 64 64 { 65 TEMPLATE_DIGRAPH_TYPEDEFS(Digraph); 66 65 TEMPLATE_DIGRAPH_TYPEDEFS(GR); 66 67 typedef ConstMap<Arc, int> ConstArcMap; 68 typedef typename GR::template NodeMap<Arc> PredMap; 69 70 public: 71 72 /// The type of the digraph the algorithm runs on. 73 typedef GR Digraph; 74 /// The type of the length map. 75 typedef LEN LengthMap; 76 /// The type of the lengths. 67 77 typedef typename LengthMap::Value Length; 68 typedef ConstMap<Arc, int> ConstArcMap;69 typedef typename Digraph::template NodeMap<Arc> PredMap;70 71 public:72 73 78 /// The type of the flow map. 74 79 typedef typename Digraph::template ArcMap<int> FlowMap; … … 257 262 /// the found arcdisjoint paths. 258 263 /// 259 /// \return \c (*this)264 /// \return <tt>(*this)</tt> 260 265 Suurballe& flowMap(FlowMap &map) { 261 266 if (_local_flow) { … … 274 279 /// minimum cost flow problem. 275 280 /// 276 /// \return \c (*this)281 /// \return <tt>(*this)</tt> 277 282 Suurballe& potentialMap(PotentialMap &map) { 278 283 if (_local_potential) { … … 459 464 /// 460 465 /// This function returns the total length (cost) of the found paths 461 /// (flow). The complexity of the function is \f$ O(e) \f$.466 /// (flow). The complexity of the function is O(e). 462 467 /// 463 468 /// \pre \ref run() or \ref findFlow() must be called before using
Note: See TracChangeset
for help on using the changeset viewer.