🎨 style: Run XO.

src/FibonacciHeap.js

@@ -89,7 +89,7 @@ export default class FibonacciHeap {
 			this.min = consolidate(this.compare, z.next);
 		}
 
-		z.next = z; // TODO remove this
+		z.next = z; // (Re)move this?
 		z.prev = z;
 		z.children = null;
 		z.degree = 0;

src/cut.js

@@ -6,6 +6,7 @@ export default function cut(x, y) {
 		y.children = x.next;
 		list_remove(x);
 	}
+
 	--y.degree;
 	x.parent = null;
 	x.mark = false;

src/fib_heap_link.js

@@ -1,4 +1,3 @@
-import list_remove from './list_remove';
 import list_insert from './list_insert';
 
 /**
@@ -7,7 +6,7 @@ import list_insert from './list_insert';
  * Precondition: y is in the root list of some heap.
  */
 export default function fib_heap_link(y, x) {
-	//list_remove(y); // NOT NECESSARY SINCE y IS ALWAYS FROM ROOT LIST
+	// List_remove(y); // NOT NECESSARY SINCE y IS ALWAYS FROM ROOT LIST
 	// make y a child of x
 	if (x.children === null) {
 		y.next = y;

src/list_reset_parent.js

@@ -6,5 +6,4 @@ export default function list_reset_parent(children) {
 		next = x.next;
 		x.parent = null;
 	} while (next !== children);
-
 }