|
Last change
on this file since 18183 was
8527,
checked in by spimming, 12 years ago
|
|
#1894:
- introduced heap interface
- various heap implementation used as priority queues
- very simple logger added
- various versions of Astar algorithm
|
|
File size:
341 bytes
|
| Line | |
|---|
| 1 |
|
|---|
| 2 | using System.Collections.Generic;
|
|---|
| 3 | namespace HeuristicLab.Algorithms.GraphRouting.Interfaces {
|
|---|
| 4 | public interface IHeap<K, V> {
|
|---|
| 5 | int Size { get; }
|
|---|
| 6 | KeyValuePair<K, V> PeekMin();
|
|---|
| 7 | K PeekMinKey();
|
|---|
| 8 | V PeekMinValue();
|
|---|
| 9 | void Insert(K key, V value);
|
|---|
| 10 | void DecreaseKey(K key, V value);
|
|---|
| 11 | void RemoveMin();
|
|---|
| 12 | }
|
|---|
| 13 | }
|
|---|
Note: See
TracBrowser
for help on using the repository browser.
