Changeset 8541 for branches/RoutePlanning

Timestamp:

08/30/12 11:25:30 (12 years ago)

Author:

spimming

Message:

#1894: renamed heap implementations

Location:

branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues

Files:

• BinaryHeap.cs (moved) (moved from branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues/BinHeap.cs) (2 diffs)
• BinaryHeapV2.cs (copied) (copied from branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues/BinaryHeap.cs) (2 diffs)

branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues/BinaryHeap.cs

@@ -4 +4 @@
 using HeuristicLab.Algorithms.GraphRouting.Interfaces;
 namespace HeuristicLab.Algorithms.GraphRouting.PriorityQueues {
-  public sealed class BinHeap<K, V> : IHeap<K, V>
+  public sealed class BinaryHeap<K, V> : IHeap<K, V>
     where K : IComparable
     where V : IComparable {
@@ -16 +16 @@
     private HeapElement[] data;
 
-    public BinHeap(int cap) {
+    public BinaryHeap(int cap) {
       size = 0;
       capacity = cap;

branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues/BinaryHeapV2.cs

@@ -6 +6 @@
   // implementation based on C++ version from Peter Sanders
   // http://www.mpi-inf.mpg.de/~sanders/programs/spq/
-  public sealed class BinaryHeap<K, V> : IHeap<K, V> where K : IComparable {
+  public sealed class BinaryHeapV2<K, V> : IHeap<K, V> where K : IComparable {
     private class KNElement {
       public K Key { get; set; }
@@ -17 +17 @@
     private KNElement[] data;
 
-    public BinaryHeap(K sup, K infimum, int cap) {
+    public BinaryHeapV2(K sup, K infimum, int cap) {
       size = 0;
       capacity = cap;