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

using System;
using HeuristicLab.Algorithms.GraphRouting.Interfaces;

namespace HeuristicLab.Algorithms.GraphRouting.PriorityQueues {
  public sealed class FibonacciHeap<K, V> : IHeap<K, V>
    where K : IComparable
    where V : IComparable {


    public int Size {
      get { throw new NotImplementedException(); }
    }

    public System.Collections.Generic.KeyValuePair<K, V> PeekMin() {
      throw new NotImplementedException();
    }

    public K PeekMinKey() {
      throw new NotImplementedException();
    }

    public V PeekMinValue() {
      throw new NotImplementedException();
    }

    public void Insert(K key, V value) {
      throw new NotImplementedException();
    }

    public void DecreaseKey(K key, V value) {
      throw new NotImplementedException();
    }

    public void RemoveMin() {
      throw new NotImplementedException();
    }
  }
}