Create tree data structures with breadth first search and depth first search algorithms
$250-750 USD
Κλειστή
Αναρτήθηκε περίπου 10 χρόνια πριν
$250-750 USD
Πληρωμή κατά την παράδοση
Write a function that will output breadth first search and depth first search order for a tree data structure. The tree shall only contain integers for it’s node. I expect the following:
(1) A PHP class that represents a tree data structure.
(2) A PHP function (BFS) that takes a tree as input and output the ordering of a breadth first search on the command line.
(3) A PHP function (DFS) that will output a depth first search on the same tree
(4) I should be able to run the class on the command line
Notes:
- Ensure that your function can handle cycles
- Ensure that the nodes can only be integer
When you apply to this job, answer the following questions. IF YOU DO NOT ANSWER THESE QUESTIONS, YOU WILL NOT BE CONSIDERED.
(1) What is the complexity (O runtime) of BFS and DFS?
(2) What is the difference between a stack and queue data structure?
(3) How many hours will it take to do this job?
Hi
I offered to delivered a desktop application in C#.
I worked before on BFS/DFS and applied it to several problem such as N-Puzzle
I attached BFS application, you can set "Goal Node" and "Max depth".
Freelancer not allow to attached any thing when set the bid, so you can reply me to be able to attached it.
Thanks
HI
Contact me for an efficient, well documented and perfect solution
and development of your project. I ensure quality work with always
on time delivery of project and dedicated support and follow up.
Thanks
Farah Saif
Hi, I am Algorithm expert and interested in this project,
Here are the answers
1. Runtime of BFS and DFS is O(V+E) where V is number of vertices and E is number of Edges.
2. Stack is a LIFO( Last in first out) whereas Queue is a FIFO( first in first out) data stcruture.
3. 5-6 hours.
Thanks
(1) Compexity is O(n + m) with n number of node and m number of edge of the graph.
(2) A stack is a Last In Last Out structure a a queue is a first in first out one.
(3) Won't take me long, you will have it by tomorrow. I would say 3 hours to be large.
I am a research and development engineer with a master in software engineering. I also worked two years in a university research lab. Such job is easy and would only takes me few hours.
Please ask for more informations if needed.
Regard