Priority Queues/Heap - Revision history

Admin: Replacing charlesreid1.com:3000 with git.charlesreid1.com

2019-10-09T03:44:20Z

Replacing charlesreid1.com:3000 with git.charlesreid1.com

← Older revision		Revision as of 03:44, 9 October 2019
Line 70:		Line 70:
	The final heap class takes a key and value type pair. See link for latest.		The final heap class takes a key and value type pair. See link for latest.

	Link: https://charlesreid1.com~~:3000~~/cs/java/src/master/priority-queues/HeapPQ.java		Link: https://git.charlesreid1.com/cs/java/src/master/priority-queues/HeapPQ.java

	<pre>		<pre>

2017-06-24T19:49:20Z

Code

← Older revision		Revision as of 19:49, 24 June 2017
Line 67:		Line 67:

	=Code=		=Code=

			The final heap class takes a key and value type pair. See link for latest.

			Link: https://charlesreid1.com:3000/cs/java/src/master/priority-queues/HeapPQ.java

	<pre>		<pre>

2017-06-24T19:48:17Z

Git Code

2017-06-24T19:48:06Z

Code

2017-06-24T19:47:46Z

Implementation

2017-06-24T19:47:31Z

Code

← Older revision		Revision as of 19:47, 24 June 2017
Line 85:		Line 85:
	}		}

	// ~~of course,~~ this is always useful to do right after the constructors		// this is always useful to do right after the constructors
	public String toString() {		public String toString() {
	return heap.toString();		return heap.toString();

2017-06-24T19:47:18Z

Code

← Older revision		Revision as of 19:47, 24 June 2017
Line 70:		Line 70:
	<pre>		<pre>
	public class HeapPQ<K,V> extends AbstractPriorityQueue<K,V> {		public class HeapPQ<K,V> extends AbstractPriorityQueue<K,V> {
	~~// cmr: Item<K,V> is from AbstractPriorityQueue class file, imported with extends above~~
	~~// protected b/c we are gonna extend this~~
	protected ArrayList<Item<K,V>> heap;		protected ArrayList<Item<K,V>> heap;

2017-06-24T19:47:05Z

Heap Remove

2017-06-24T06:16:05Z

Git Code

@@ Line 46: / Line 46: @@
 if k_p > k_c, swap to restore heap order property and continue to apply down tree
 </pre>
 =Git Code=

2017-06-24T06:14:59Z

Notes

← Older revision		Revision as of 06:14, 24 June 2017
Line 16:		Line 16:
	* Height = floor(log(N))		* Height = floor(log(N))

	===Heap Add===		==Heap Add==

	Add to the next spot in the tree		Add to the next spot in the tree
Line 32:		Line 32:
	</pre>		</pre>

	===Heap Remove===		==Heap Remove==

	Remove root of the tree (minimum item in tree)		Remove root of the tree (minimum item in tree)
Line 46:		Line 46:
	if k_p > k_c, swap to restore heap order property and continue to apply down tree		if k_p > k_c, swap to restore heap order property and continue to apply down tree
	</pre>		</pre>




	=Git Code=		=Git Code=