Scribd
Upload
58 views3 pages

Fibonacci Heap Node

This document defines a Fibonacci heap data structure with classes for nodes, the heap itself, and a test class. The FibonacciHeapNode class defines nodes with element values and pointers. The FibonacciHeap class implements insert, isEmpty, clear, and display methods on the heap. The FibonacciHeapTest class contains a main method that tests the heap functionality by prompting the user to insert elements, check if empty, clear, and display the heap.

Uploaded by

Peda Baji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
58 views3 pages

Fibonacci Heap Node

This document defines a Fibonacci heap data structure with classes for nodes, the heap itself, and a test class. The FibonacciHeapNode class defines nodes with element values and pointers. The FibonacciHeap class implements insert, isEmpty, clear, and display methods on the heap. The FibonacciHeapTest class contains a main method that tests the heap functionality by prompting the user to insert elements, check if empty, clear, and display the heap.

Uploaded by

Peda Baji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

import java.util.

*;
�
/* Fibonacci Heap Node **/
class FibonacciHeapNode
{
FibonacciHeapNode child, left, right, parent;
int element;
� /** Constructor **/
public FibonacciHeapNode(int element)
{
this.right = this;
this.left = this;
this.element = element;
}
}
�
/** Class FibonacciHeap **/
class FibonacciHeap
{
private FibonacciHeapNode root;
private int count;
�
/** Constructor **/
public FibonacciHeap()
{
root = null;
count = 0;
}
�
/** Check if heap is empty **/
public boolean isEmpty()
{
return root == null;
}
�
/** Make heap empty **/
public void clear()
{
root = null;
count = 0;
}
�
/** Function to insert **/
public void insert(int element)
{
FibonacciHeapNode node = new FibonacciHeapNode(element);
node.element = element;
�
if (root != null)
{
node.left = root;
node.right = root.right;
root.right = node;
node.right.left = node;
if (element < root.element)
root = node;
}
else
root = node;
count++;
}
�
/** function to display **/
public void display()
{
System.out.print("\nHeap = ");
FibonacciHeapNode ptr = root;
if (ptr == null)
{
System.out.print("Empty\n");
return;
}
do
{
System.out.print(ptr.element +" ");
ptr = ptr.right;
} while (ptr != root && ptr.right != null);
System.out.println();
}
}
�
/** Class FibonacciHeapTest **/
public class FibonacciHeapTest
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("FibonacciHeap Test\n\n");
FibonacciHeap fh = new FibonacciHeap();
�
char ch;
/** Perform FibonacciHeap operations **/
do
{
System.out.println("\nFibonacciHeap Operations\n");
System.out.println("1. insert element ");
System.out.println("2. check empty");
System.out.println("3. clear");
� int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println("Enter element");
fh.insert( scan.nextInt() );
break;
case 2 :
System.out.println("Empty status = "+ fh.isEmpty());
break;
case 3 :
fh.clear();
break;
default :
System.out.println("Wrong Entry \n ");
break;
}
fh.display();
�
System.out.println("\nDo you want to continue (Type y or n) \n");
ch = scan.next().charAt(0);
} while (ch == 'Y'|| ch == 'y');
}
}

You might also like