Algorithms_in_C++
1.0.0
Set of algorithms implemented in C++.
|
2 #ifndef DATA_STRUCTURES_QUEUE_H_
3 #define DATA_STRUCTURES_QUEUE_H_
23 while (current != NULL) {
25 current = current->next;
88 #endif // DATA_STRUCTURES_QUEUE_H_
void CreateSet(int n)
Definition: disjoint_set.cpp:37
bool isDigit(const std::string &s)
Definition: linked_list.cpp:40
node< Kind > * queueFront
Definition: queue.h:83
int val()
Definition: linked_list.cpp:63
void erase(int old_elem)
Definition: linked_list.cpp:152
void display()
Definition: queue.h:20
Functions for singly linked list algorithm.
int main()
Definition: disjoint_set.cpp:93
Definition: linked_list.cpp:81
link(int value=0)
Definition: linked_list.cpp:75
std::shared_ptr< link > last
last link on the list
Definition: linked_list.cpp:84
int Find(int x)
Definition: disjoint_set.cpp:53
Definition: avltree.cpp:13
std::shared_ptr< link > psucc
pointer to the next value on the list
Definition: linked_list.cpp:56
queue()
Definition: queue.h:32
int main()
Definition: linkedlist_implentation_usingarray.cpp:79
int pvalue
value of the current link
Definition: linked_list.cpp:55
Definition: linkedlist_implentation_usingarray.cpp:14
void display()
Definition: linked_list.cpp:178
void push_front(int new_elem)
Definition: linked_list.cpp:137
void push_back(int new_elem)
Definition: linked_list.cpp:123
void enQueue(Kind item)
Definition: queue.h:45
bool isEmptyQueue()
Definition: queue.h:42
void clear()
Definition: queue.h:80
node * insert(node *root, int item)
Definition: avltree.cpp:66
std::shared_ptr< link > & succ()
Definition: linked_list.cpp:69
int main()
Definition: linked_list.cpp:219
Data Structures algorithms.
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
#define endl
Definition: matrix_exponentiation.cpp:36
bool InSameUnion(int x, int y)
Definition: disjoint_set.cpp:67
int getnode()
Definition: linkedlist_implentation_usingarray.cpp:32
~queue()
Definition: queue.h:39
std::shared_ptr< link > search(int find_elem)
Definition: linked_list.cpp:194
int data[MAX]
test data
Definition: hash_search.cpp:24
Kind front()
Definition: queue.h:61
std::shared_ptr< link > first
link before the actual first element
Definition: linked_list.cpp:83
list()
Definition: linked_list.cpp:89
void freeNode(int nodeToBeDeleted)
Definition: linkedlist_implentation_usingarray.cpp:42
void Union(int x, int y)
Definition: disjoint_set.cpp:78
bool isEmpty()
Definition: linked_list.cpp:111
Definition: linked_list.cpp:53
Definition: morrisinorder.cpp:10
Definition: doubly_linked_list.cpp:11
node< Kind > * queueRear
Definition: queue.h:84
Definition: list_array.cpp:8
int main()
Definition: graph_coloring.cpp:96
Node AvailArray[100]
array that will act as nodes of a linked list.
Definition: linkedlist_implentation_usingarray.cpp:19
void deQueue()
Definition: queue.h:67