Changeset 606:c5fd2d996909 in lemon for lemon/hao_orlin.h
- Timestamp:
- 03/29/09 23:08:20 (16 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/hao_orlin.h
r463 r606 58 58 /// algorithm or you can use the algorithm of Nagamochi and Ibaraki 59 59 /// which solves the undirected problem in 60 /// \f$ O(nm + n^2 \log (n)) \f$ time: it is implemented in the60 /// \f$ O(nm + n^2 \log n) \f$ time: it is implemented in the 61 61 /// NagamochiIbaraki algorithm class. 62 62 /// 63 /// \param _Digraph is the graph type of the algorithm.64 /// \param _CapacityMap is an edge map of capacities which should65 /// be any numreric type. The default type is _Digraph::ArcMap<int>.66 /// \param _Tolerance is the handler of the inexact computation. The67 /// default t ype for this is Tolerance<CapacityMap::Value>.63 /// \param GR The digraph class the algorithm runs on. 64 /// \param CAP An arc map of capacities which can be any numreric type. 65 /// The default type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". 66 /// \param TOL Tolerance class for handling inexact computations. The 67 /// default tolerance type is \ref Tolerance "Tolerance<CAP::Value>". 68 68 #ifdef DOXYGEN 69 template <typename _Digraph, typename _CapacityMap, typename _Tolerance>69 template <typename GR, typename CAP, typename TOL> 70 70 #else 71 template <typename _Digraph,72 typename _CapacityMap = typename _Digraph::template ArcMap<int>,73 typename _Tolerance = Tolerance<typename _CapacityMap::Value> >71 template <typename GR, 72 typename CAP = typename GR::template ArcMap<int>, 73 typename TOL = Tolerance<typename CAP::Value> > 74 74 #endif 75 75 class HaoOrlin { 76 76 private: 77 77 78 typedef _DigraphDigraph;79 typedef _CapacityMapCapacityMap;80 typedef _ToleranceTolerance;78 typedef GR Digraph; 79 typedef CAP CapacityMap; 80 typedef TOL Tolerance; 81 81 82 82 typedef typename CapacityMap::Value Value; … … 818 818 /// \name Execution control 819 819 /// The simplest way to execute the algorithm is to use 820 /// one of the member functions called \ c run(...).820 /// one of the member functions called \ref run(). 821 821 /// \n 822 822 /// If you need more control on the execution,
Note: See TracChangeset
for help on using the changeset viewer.