# Package lv.lumii.layoutengine.flowLayout.horizontalOrdering.pqtree

- Class Summary
  Class | Description
  --- | ---
  CNode<T> | This class implements C-type node for PQ-tree data structure.
  ObjectSeqComparator<T> | This class compares two objects that have min and max int value associated with them.
  PNode<T> | This class implements P-type node for PQ-Tree data structure.
  PQTree<T> | This class implements PQTree data structure.
  PQTreeList<T> | This class implements list of PQ-Trees that support all list operations and several others.
  PQTreeLLComparator | This class compares two PQTrees by their LL values and considers smaller the one with smaller LL value.
  PQTreeNode<T> | This class implements all common methods that are common to P, Q and C-type nodes.
  PQTreeNodeLevelComparator | This class implements comparator that compares PQTreeNodes and considers first node smaller than second node if first node is in level with larger number than second node's level number.
  PQTreeNodeStableComparator | This class implements comparator that compares two PQ tree nodes and considers first node smaller than second if none of both nodes are in new node set or if at least one of nodes are in new node set and PQTreeSeqComparator considers first node smaller or equal than second.
  PQTreeSeqComparator | This class implements comparator that compares two PQ tree nodes and considers first node smaller or equal than second.
  QNode<T> | This class implements Q-type node of PQTree data structure.
  Sort<T> | This class implements a stable sort algorithm needed for the horizontal ordering of a layered graph.