source: branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueues/FibonacciHeap.cs @ 8546

Last change on this file since 8546 was 8546, checked in by spimming, 7 years ago

#1894:

  • fast binary heap added
  • 4-ary binary heap added
  • FibonacciHeap initial commit
File size: 916 bytes
Line 
1using System;
2using HeuristicLab.Algorithms.GraphRouting.Interfaces;
3
4namespace HeuristicLab.Algorithms.GraphRouting.PriorityQueues {
5  public sealed class FibonacciHeap<K, V> : IHeap<K, V>
6    where K : IComparable
7    where V : IComparable {
8
9
10    public int Size {
11      get { throw new NotImplementedException(); }
12    }
13
14    public System.Collections.Generic.KeyValuePair<K, V> PeekMin() {
15      throw new NotImplementedException();
16    }
17
18    public K PeekMinKey() {
19      throw new NotImplementedException();
20    }
21
22    public V PeekMinValue() {
23      throw new NotImplementedException();
24    }
25
26    public void Insert(K key, V value) {
27      throw new NotImplementedException();
28    }
29
30    public void DecreaseKey(K key, V value) {
31      throw new NotImplementedException();
32    }
33
34    public void RemoveMin() {
35      throw new NotImplementedException();
36    }
37  }
38}
Note: See TracBrowser for help on using the repository browser.