Project Description
MinHeap project provides a MinHeap implementation in C# for use in Dijkstra's algorithm for computing shortest path distances for non-negative edge lengths.

MinHeap supports the following operations:
  1. Insert(key, value)
  2. ExtractMin()
  3. Update(key)
  4. Delete(key)
  5. Find(key)

The key is used to find and update the value stored in the Min Heap. The Min Heap arranges the elements by value.

For an example of how to use the MinHeap class, please visit my blog: Min Heap implementation for Dijkstra's algorithm.

Last edited Aug 2, 2014 at 5:02 AM by vijayst, version 4