Changeset 2530:f86f7e4eb2ba in lemon0.x for lemon/nagamochi_ibaraki.h
 Timestamp:
 12/04/07 11:55:27 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3407
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/nagamochi_ibaraki.h
r2506 r2530 848 848 /// 849 849 /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with 850 /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. 851 /// When capacity map is neutral then it uses BucketHeap which852 /// results \f$ O(ne) \f$ time complexity.850 /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. 851 /// When unit capacity minimum cut is computed then it uses 852 /// BucketHeap which results \f$ O(ne) \f$ time complexity. 853 853 /// 854 854 /// \warning The value type of the capacity map should be able to hold … … 907 907 ///@{ 908 908 909 struct Def NeutralCapacityTraits : public Traits {909 struct DefUnitCapacityTraits : public Traits { 910 910 typedef ConstMap<typename Graph::UEdge, Const<int, 1> > CapacityMap; 911 911 static CapacityMap *createCapacityMap(const Graph&) { … … 918 918 /// \ref namedtemplparam "Named parameter" for setting 919 919 /// the capacity type to constMap<UEdge, int, 1>() 920 struct Def NeutralCapacity920 struct DefUnitCapacity 921 921 : public NagamochiIbaraki<Graph, CapacityMap, 922 Def NeutralCapacityTraits> {922 DefUnitCapacityTraits> { 923 923 typedef NagamochiIbaraki<Graph, CapacityMap, 924 Def NeutralCapacityTraits> Create;924 DefUnitCapacityTraits> Create; 925 925 }; 926 926 … … 1135 1135 /// This constructor can be used only when the Traits class 1136 1136 /// defines how can we instantiate a local capacity map. 1137 /// If the Def NeutralCapacity used the algorithm automatically1137 /// If the DefUnitCapacity used the algorithm automatically 1138 1138 /// construct the capacity map. 1139 1139 ///
Note: See TracChangeset
for help on using the changeset viewer.