Dijkstra's Algorithm function

enqueues an entry into the Priority Queue

Returns the root value and deletes it by swapping the root node and the last node and then calling heapify on root node

Removes and Returns the topmost element - O (log N)

Traverses the Heap top-to-bottom once and returns the location of the last node. Works on the priciple of traversing a Binary Tree by the binary repre

Allocates memory for the Binary Heap thus creates the root node

Retuns the vertex which is not visited and has least distance

Allocates memory for the root and calls method to construct the Segment Tree

Recursive procedure to find out the sum of elements from arr[low] to arr[high] using the Segment Tree

Heap Sort procedure which takes and empyt list 'Sorted List' and fills it with the elements in sorted order. Keeps extracting the maximum element from

The standard recursive Heapify procedure to convert a partial heap to a complete heap Mainly used by Extract-Max procedure

Prints the nodes of the Binary Heap in the In-Order fashion

Inserts a new node into the binary heap and also makes the neccessary swaps to ensure Heap Property isn't violated

The recursive procedure which goes top-to-bottom from the root to the place of insertion and inserts the new node with a value 'Value'. Uses binary tr

Inserts a word 'text' into the Trie Tree 'trieTree' and marks it's occurence as 'index'.

Merges two sorted partitions into a bigger sorted array

Partitions the array into two Does nothing if array has only one element

Prim's Algorithm function

Prim's Algorithm function

A simple utility function to aid In-Order Walk

Recursively looks at a vertex's parent to print the path

Recursively looks at a vertex's parent to print the path

Recursively looks at a vertex's parent to print the path

Removes the first occurence of an edge and returns true if there was any change in the collection, else false

Searches the word first, if not found, does nothing if found, deletes the nodes corresponding to the word

Searches for the occurence of a word in 'trieTree', if not found, returns NULL, if found, returns poniter pointing to the last node of the word in the

Updates an element in the Segment Tree and makes the neccessary adjustments

Constructor - creates an empty Adjacency List

Adds a new Edge to the linked list from the front

Returns number of vertices Does not change for an object