Package edu.claflin.finder.algo.clustering.struct.fast_greedy_struct

# Class IndexedHeapQueue

java.lang.Object
edu.claflin.finder.algo.clustering.struct.fast_greedy_struct.IndexedHeapQueue

public class IndexedHeapQueue extends Object

Author:
  Cesar Martin

- ## Field Summary

  Fields
  Modifier and Type
  Field
  Description
  `private PriorityQueue<IndexedHeapNode>`
  `q`

- ## Constructor Summary

  Constructors
  Constructor
  Description
  `IndexedHeapQueue()`

- ## Method Summary

  Modifier and Type
  Method
  Description
  `void`
  `add(int i, int j, double a)`
  `boolean`
  `isEmpty()`
  `IndexedHeapNode`
  `peek()`
  `IndexedHeapNode`
  `poll()`
  `void`
  `replaceNodes(List<IndexedHeapNode> nodes)`
  Replace nodes in the queue with their counterparts in a given list, according to row number (i).
  `int`
  `size()`
  `String`
  `toString()`

  ### Methods inherited from class java.lang.Object

  `clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

- ## Field Details

  - ### q

    private PriorityQueue<IndexedHeapNode> q

- ## Constructor Details

  - ### IndexedHeapQueue

    public IndexedHeapQueue()

- ## Method Details

  - ### size

    public int size()

  - ### isEmpty

    public boolean isEmpty()

  - ### add

    public void add(int i, int j, double a)

  - ### peek

    public IndexedHeapNode peek()

  - ### poll

    public IndexedHeapNode poll()

  - ### replaceNodes

    public void replaceNodes(List<IndexedHeapNode> nodes)
    Replace nodes in the queue with their counterparts in a given list, according to row number (i).
    Parameters:
      `nodes` - the new Nodes

  - ### toString

    public String toString()
    Overrides:
      `toString` in class `Object`