Compilation: javac Heap.java
Execution: java Heap < input.txt
Dependencies: StdOut.java StdIn.java
Data files: https://algs4.cs.princeton.edu/24pq/tiny.txt
https://algs4.cs.princeton.edu/24pq/words3.txt
Sorts a sequence of strings from standard input using heapsort.
Heap(int) - Constructor for class com.example.colibris.multi.graph.Heap
Initializes an empty indexed priority queue with indices between 0
and maxN - 1.
The HyperConnection class represents a edge-weighted
hypergraph composed of vertices named 0 through V - where each
directed hypereedge is of type HyperEdge and is composed of a set of
inner-edges.