COIN-OR::LEMON - Graph Library

Changeset 2038:33db14058543 in lemon-0.x for lemon


Ignore:
Timestamp:
04/04/06 19:45:35 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2677
Message:

LinearHeap? is renamed to BucketHeap? which is more conform
and widely used name for this data structure

Location:
lemon
Files:
1 added
1 deleted
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/Makefile.am

    r2035 r2038  
    5454        johnson.h \
    5555        kruskal.h \
    56         linear_heap.h \
     56        bucket_heap.h \
    5757        list_graph.h \
    5858        lp.h \
  • lemon/min_cut.h

    r2037 r2038  
    2525#include <lemon/list_graph.h>
    2626#include <lemon/bin_heap.h>
    27 #include <lemon/linear_heap.h>
     27#include <lemon/bucket_heap.h>
    2828
    2929#include <lemon/bits/invalid.h>
     
    4949      template <typename Key, typename Value, typename Ref>
    5050      struct Selector {
    51         typedef LinearHeap<Key, Ref, false > Heap;
     51        typedef BucketHeap<Key, Ref, false > Heap;
    5252      };
    5353    };
     
    9595    /// the \ref BinHeap, but it is specialized when the
    9696    /// CapacityMap is ConstMap<Graph::Node, Const<int, 1> >
    97     /// to LinearHeap.
     97    /// to BucketHeap.
    9898    ///
    9999    /// \sa MaxCardinalitySearch
     
    842842  /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci
    843843  /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity
    844   /// map is used then it uses LinearHeap which results O(n*e) time complexity.
     844  /// map is used then it uses BucketHeap which results O(n*e) time complexity.
    845845#ifdef DOXYGEN
    846846  template <typename _Graph, typename _CapacityMap, typename _Traits>
  • lemon/topology.h

    r1979 r2038  
    3131
    3232#include <lemon/bin_heap.h>
    33 #include <lemon/linear_heap.h>
     33#include <lemon/bucket_heap.h>
    3434
    3535#include <stack>
Note: See TracChangeset for help on using the changeset viewer.