Package org.drip.graph.asymptote

Class PairingHeapTimeComplexity

java.lang.Object

org.drip.graph.asymptote.AlgorithmTimeComplexity

org.drip.graph.asymptote.PairingHeapTimeComplexity

public class PairingHeapTimeComplexity
extends AlgorithmTimeComplexity

PairingHeapTimeComplexity maintains the Asymptotic Behavior Specifications of a Pairing Heap's Operations. The References are:

• Brodal, G. S. (1996): Priority Queue on Parallel Machines Scandinavian Workshop on Algorithm Theory – SWAT ’96 416-427
• Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3^rd Edition MIT Press
• Sanders, P., K. Mehlhorn, M. Dietzfelbinger, and R. Dementiev (2019): Sequential and Parallel Algorithms and Data Structures – A Basic Toolbox Springer
• Sundell, H., and P. Tsigas (2005): Fast and Lock-free Concurrent Priority Queues for Multi-threaded Systems Journal of Parallel and Distributed Computing 65 (5) 609-627
• Wikipedia (2020): Priority Queue https://en.wikipedia.org/wiki/Priority_queue

• Module = Computational Core Module
• Library = Graph Algorithm Library
• Project = Graph Optimization and Tree Construction Algorithms
• Package = Big O Algorithm Asymptotic Analysis

Author:

Lakshmi Krishnamurthy

Constructor Summary

Constructors

Constructor	Description
PairingHeapTimeComplexity()

Method Summary

Modifier and Type	Method	Description
static PairingHeapTimeComplexity	Standard()	Build the Algorithm Time Complexity for a Pairing Heap

Methods inherited from class org.drip.graph.asymptote.AlgorithmTimeComplexity

addOperationTimeComplexity, operationTimeComplexityMap

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

PairingHeapTimeComplexity

public PairingHeapTimeComplexity()

Method Details

Standard

public static final PairingHeapTimeComplexity Standard()

Build the Algorithm Time Complexity for a Pairing Heap

Returns:

The Algorithm Time Complexity for a Pairing Heap