Package org.drip.graph.softheap

Soft Heap - Approximate Priority Queue
Author:
Lakshmi Krishnamurthy
  • Class Summary
    Class Description
    ApproximatePriorityQueue<KEY extends java.lang.Comparable<KEY>,​ITEM>
    ApproximatePriorityQueue exposes the Functions Approximate Priority Queue with Optimal Error Rate.
    KaplanZwickBinaryNode<KEY extends java.lang.Comparable<KEY>,​ITEM>
    KaplanZwickBinaryNode implements the Binary Node described in Kaplan and Zwick (2009).
    KaplanZwickPriorityQueue<KEY extends java.lang.Comparable<KEY>,​ITEM>
    KaplanZwickPriorityQueue implements the Soft Heap described in Kaplan and Zwick (2009).
    KaplanZwickTargetSize
    KaplanZwickTargetSize implements the Target Size Metrics described in Kaplan and Zwick (2009).
    KaplanZwickTree<KEY extends java.lang.Comparable<KEY>,​ITEM>
    KaplanZwickTree implements the Tree described in Kaplan and Zwick (2009).
    KaplanZwickTreeMelder<KEY extends java.lang.Comparable<KEY>,​ITEM>
    KaplanZwickTreeMelder grows the Melded Tree List.