Pallavi-Pamulapati / Tree-Search-Library

Mini-Project-Team56

TA incharge

• Arpan Dasgupta

Team Members email

• [e-mail] (Dhruv)
• [e-mail] (Pallavi)
• [e-mail] (Ujwal)
• [e-mail] (Lakshmi)
• [e-mail] (Raj) #happy coding...

Compilation Instructions

Steps for greedy search

1. node_comparator should look like this

bool node_comparator(node *a, node *b)
{
    // User puts in the node comparator here
    return a->value > b->value; // A sample comparator
}

2. Write this command on terminal to compile

gcc node.c priority_queue.c main.c  

3. To run the File

./a.out

4. Give the test-case of your choice

Steps for BFS

1. node_comparator should look like this

bool node_comparator(node *a, node *b)
{
    // User puts in the node comparator here
    return a->seen_time < b->seen_time; // A sample comparator
}

2. Write this command on terminal to compile

gcc node.c priority_queue.c main.c  

3. To run the File

./a.out

4. Give the test-case of your choice

Steps for DFS

1. node_comparator should look like this

bool node_comparator(node *a, node *b)
{
    // User puts in the node comparator here
    return a->seen_time > b->seen_time; // A sample comparator
}

2. Write this command on terminal to compile

gcc node.c priority_queue.c main.c  

3. To run the File

./a.out

4. Give the test-case of your choice