//$goals 25 //$benchmark public void removeMinTest(FibHeap fibHeap) { if (fibHeap != null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.removeMin(); } }
//$goals 1 //$benchmark public void minimumTest(FibHeap fibHeap) { if (fibHeap != null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.minimum(); } }
//$goals 5 //$benchmark public void insertNodeTest(FibHeap fibHeap, FibHeapNode toInsert) { if (fibHeap != null && toInsert != null && toInsert.left == toInsert && toInsert.right == toInsert && toInsert.parent == null && toInsert.child == null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.insertNode(toInsert); } }
//$goals 1 //$benchmark public void minimumTest(FibHeap fibHeap) { if (fibHeap!=null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.minimum(); } }
//$goals 5 //$benchmark public void insertNodeTest(FibHeap fibHeap, FibHeapNode toInsert) { if (fibHeap!=null && toInsert!=null && toInsert.left==toInsert && toInsert.right==toInsert && toInsert.parent==null && toInsert.child==null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.insertNode(toInsert); } }
//$goals 25 //$benchmark public void removeMinTest(FibHeap fibHeap) { if (fibHeap!=null && fibHeap.repOK()) { FibHeapNode ret_val = fibHeap.removeMin(); } }