Max-Fibonacci Heap is a data-structure consisting of heap-ordered trees that has better amortized run-time complexity than a Binomial and Binary Heap. It is used as a priority queue in Dijkstra’s algorithm for computing the shortest path between two elements of graph. The code uses Max-Fibonacci Heap to find popular hashtags that appears on Facebook or Twitter.
Install latest java-jre and jdk.
Clone the repository using the below mentioned command and execute the bash script.
https://github.com/vyassu/FibonacciHeap.git
cd FibonacciHeap
1.) Run the make file
2.) Execute the command $java hashtagcounter file_name in the same folder