adjacency list of graph

Function to add an item to the queue. It changes rear and size

Finds if game is won and updates self.winning_player

A utility function to do inorder traversal of BST

If not present, inserts key into trie If the key is prefix of trie node, just marks leaf node

A utility function to find Log n in base 2

newNode() allocates a new node with the given data and NULL left and right pointers. */

newNode() allocates a new node with the given data and NULL left and right pointers. */

* Retourne une nouvelle Liste * @return Une liste vide */

calculates the root of each tree

Function to push according to priority

+=============================================================================

+============================================================================= The match functions were (apparently) originally MACROs to improve code

GenerateHuffmanTree generates a HuffmanTree based on the data passed in the parameter.

location of x in given array arr[l..r] is present, otherwise -1

Dequeue an item from the queue

Dequeue an item from the queue

Given a binary search tree and a key, this function deletes the key and returns the new root */

Enqueue an item to the queue

Returns index of the maximum element in arr[0..n-1]

Finds if current board_state is full and the game is over

IContext

@param object the object you wish to know the index of @return the index of the object, or -1 if the object is not in the array

recursive function to perform inorder traversal of tree */

Método que verifica se é uma aresta @param v Nome do vértice de início (estação de partida) @param u Nome do vértice final (estação de destino) @retur

Queue is empty when size is 0