Algorithms_in_C  1.0.0
Set of algorithms implemented in C.
queue.h
1 // Queue ADT header file ... COMP2521
2 
3 typedef struct QueueRep *queue;
4 
5 queue newQueue(); // set up empty queue
6 void dropQueue(queue); // remove unwanted queue
7 int QueueIsEmpty(queue); // check whether queue is empty
8 void QueueEnqueue(queue, int); // insert an int at end of queue
9 int QueueDequeue(queue); // remove int from front of queue
10 
11 // By
12 // .----------------. .----------------. .----------------.
13 // .-----------------. .----------------. .----------------.
14 // | .--------------. || .--------------. || .--------------. ||
15 // .--------------. | | .--------------. || .--------------. | | | _________ |
16 // || | _____ _____ | || | __ | || | ____ _____ | | | | ____ ____
17 // | || | ____ | | | | | _ _ | | || ||_ _||_ _|| || | / \
18 // | || ||_ \|_ _| | | | | |_ || _| | || | .' `. | | | | |_/ | |
19 // \_| | || | | | | | | || | / /\ \ | || | | \ | | | | | | |
20 // |__| | | || | / .--. \ | | | | | | | || | | ' ' | | || |
21 // / ____ \ | || | | |\ \| | | | | | | __ | | || | | | | | | |
22 // | | _| |_ | || | \ `--' / | || | _/ / \ \_ | || | _| |_\ |_
23 // | | | | _| | | |_ | || | \ `--' / | | | | |_____| | || | `.__.'
24 // | || ||____| |____|| || ||_____|\____| | | | | |____||____| | || | `.____.'
25 // | | | | | || | | || | | || | | | | |
26 // | || | | | | '--------------' || '--------------' ||
27 // '--------------' || '--------------' | | '--------------' || '--------------'
28 // |
29 // '----------------' '----------------' '----------------'
30 // '----------------' '----------------' '----------------'
31 
32 // Email : z5261243@unsw.edu.au
33 // hhoanhtuann@gmail.com
node
Node, the basic data structure in the tree.
Definition: binary_search_tree.c:15
node::data
int data
data of the node
Definition: binary_search_tree.c:18
queue
Definition: bfs.c:6
main
int main()
Driver code.
Definition: client.c:70
QueueRep
Definition: queue.c:14
find
int find(node *root, int data)
Search procedure, which looks for the input key in the tree and returns 1 if it's present or 0 if it'...
Definition: binary_search_tree.c:152
subset
Definition: kruskal.c:41
Edge
Definition: bellman_ford.c:8
Graph
Definition: bellman_ford.c:14