Changeset 2038:33db14058543 in lemon-0.x
- Timestamp:
- 04/04/06 19:45:35 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2677
- Files:
-
- 1 added
- 1 deleted
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/coloring.cc
r1959 r2038 31 31 32 32 #include <lemon/smart_graph.h> 33 #include <lemon/ linear_heap.h>33 #include <lemon/bucket_heap.h> 34 34 #include <lemon/graph_reader.h> 35 35 #include <lemon/graph_to_eps.h> … … 64 64 65 65 Graph::NodeMap<int> heapMap(graph, -1); 66 LinearHeap<Node, Graph::NodeMap<int> > heap(heapMap);66 BucketHeap<Node, Graph::NodeMap<int> > heap(heapMap); 67 67 68 68 for (NodeIt it(graph); it != INVALID; ++it) { -
lemon/Makefile.am
r2035 r2038 54 54 johnson.h \ 55 55 kruskal.h \ 56 linear_heap.h \56 bucket_heap.h \ 57 57 list_graph.h \ 58 58 lp.h \ -
lemon/min_cut.h
r2037 r2038 25 25 #include <lemon/list_graph.h> 26 26 #include <lemon/bin_heap.h> 27 #include <lemon/ linear_heap.h>27 #include <lemon/bucket_heap.h> 28 28 29 29 #include <lemon/bits/invalid.h> … … 49 49 template <typename Key, typename Value, typename Ref> 50 50 struct Selector { 51 typedef LinearHeap<Key, Ref, false > Heap;51 typedef BucketHeap<Key, Ref, false > Heap; 52 52 }; 53 53 }; … … 95 95 /// the \ref BinHeap, but it is specialized when the 96 96 /// CapacityMap is ConstMap<Graph::Node, Const<int, 1> > 97 /// to LinearHeap.97 /// to BucketHeap. 98 98 /// 99 99 /// \sa MaxCardinalitySearch … … 842 842 /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci 843 843 /// 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. 845 845 #ifdef DOXYGEN 846 846 template <typename _Graph, typename _CapacityMap, typename _Traits> -
lemon/topology.h
r1979 r2038 31 31 32 32 #include <lemon/bin_heap.h> 33 #include <lemon/ linear_heap.h>33 #include <lemon/bucket_heap.h> 34 34 35 35 #include <stack> -
test/heap_test.cc
r1956 r2038 32 32 #include <lemon/fib_heap.h> 33 33 #include <lemon/radix_heap.h> 34 #include <lemon/ linear_heap.h>34 #include <lemon/bucket_heap.h> 35 35 36 36 #include "test_tools.h" … … 121 121 122 122 { 123 std::cerr << "Checking LinearHeap" << std::endl;123 std::cerr << "Checking Bucket Heap" << std::endl; 124 124 125 typedef LinearHeap<Item, ItemIntMap> IntHeap;125 typedef BucketHeap<Item, ItemIntMap> IntHeap; 126 126 checkConcept<Heap<Item, Prio, ItemIntMap>, IntHeap>(); 127 127 heapSortTest<IntHeap>(100); 128 128 heapIncreaseTest<IntHeap>(100); 129 129 130 typedef LinearHeap<Node, Graph::NodeMap<int> > NodeHeap;130 typedef BucketHeap<Node, Graph::NodeMap<int> > NodeHeap; 131 131 checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>(); 132 132 Timer timer;
Note: See TracChangeset
for help on using the changeset viewer.