public int CompareTo(PriorityQueueNode <V, P> other)
{
if (other == null)
{
return(-1);
}
return(this.Priority.CompareTo(other.Priority));
}
/// <summary>
/// Enqueue the specified key, value and priority.
/// </summary>
/// <param name="key">Key.</param>
/// <param name="value">Value.</param>
/// <param name="priority">Priority.</param>
public void Enqueue(K key, V value, P priority)
{
if (!_keysMap.ContainsKey(key))
{
_keysMap.Add(key, 1);
}
else
{
_keysMap[key] += 1;
}
var newNode = new PriorityQueueNode <K, V, P>(key, value, priority);
_heap.Add(newNode);
}
/// <summary>
/// Enqueue the specified key, value and priority.
/// </summary>
/// <param name="value">Value.</param>
/// <param name="priority">Priority.</param>
public void Enqueue(TKey key, TPriority priority)
{
var newNode = new PriorityQueueNode <TKey, TPriority>(key, priority);
_heap.Add(newNode);
if (_keys.ContainsKey(key))
{
_keys[key] += 1;
}
else
{
_keys.Add(key, 1);
}
}
public int Compare(PriorityQueueNode <V, P> first, PriorityQueueNode <V, P> second)
{
return(first.Priority.CompareTo(second.Priority));
}
/// <summary>
/// Enqueue the specified key, value and priority.
/// </summary>
/// <param name="value">Value.</param>
/// <param name="priority">Priority.</param>
public void Enqueue(V value, P priority)
{
var newNode = new PriorityQueueNode <V, P>(value, priority);
_heap.Add(newNode);
}
/// <summary>
/// Enqueue the specified key, value and priority.
/// </summary>
/// <param name="value">Value.</param>
/// <param name="priority">Priority.</param>
public void Enqueue(TKey value, TPriority priority)
{
var newNode = new PriorityQueueNode <TKey, TPriority>(value, priority);
_heap.Add(newNode);
}
/// <summary>
/// Enqueue the specified key, with the default-max-priority value.
/// </summary>
public void Enqueue(TKey value)
{
var newNode = new PriorityQueueNode <TKey, TPriority>(value, DefaultMaxPriority);
_heap.Add(newNode);
}
