In my previous post I discussed the difference between a graph data structure and a tree data structure. Now that you understand the difference between the two data structures, I am going to show you how you can search through your data.
The two most common methods of searching a graph or a tree are depth first search and breadth first search.
Whether to use a depth first search or a breadth first search should be determined by the type of data that is contained in your tree or graph data structure.
Graphs Data Structures
Graphs evolved from the field of mathematics. They are primarily used to describe a model that shows the route from one location to another location.
A graph consists of a set of nodes and a set of edges. An edge is a pair of nodes that are connected. A path is the term used to describe traveling between nodes that share an edge. The image below shows a graph with 3 nods and 3 edges.
Just completed my second week at Hack Reactor. The first hour of Monday was spent on completing a self assessment used to measure how well we learned the material covered in the first week. We were given 5 exercises that we had to complete in a 30 minutes.
The 5 exercises covered the major topics that were covered in our first week at Hack Reactor. Here are the exercises we had to complete:
- Write a reduce function
- Write two new methods that would extend the Array prototype
- Describe differences between a stack and an array
- Write a stack function
- Write a function to handle collision in a hash table
My first week I spent a grand total of 75 hours in classes. I also did an additional 9 hours of studying and programming outside of classes. All total in the first week I spent 84 hours in training.
Before you start your first day of classes you have already completed an immense amount of pre-course material. If you want to know what is covered then you can check out my post about my pre-course work at Hack Reactor.
Hack Reactor is a 13 week long intensive immersive coding boot camp. It was recently voted one of the top coding schools in the world.
Hack Reactor is incredibly successful in its development of very competent and qualified full-stack programmers after only 13 weeks of training. Their success is reflected in the stats that 99% of their graduates are able to obtain full-time employment after graduation. The average salary of graduates is $105k!
Applying to Hack Reactor and getting accepted is a very challenging endeavor. They only accept 3% of the applicants into the program. Once you are accepted you are assigned to a cohort class that will be starting anywhere from 3-9 weeks in the future.
The reason for the delay in starting is that you must complete successfully all of their pre-course work. Even if you are accepted into Hack Reactor, you will not be allowed to start with your cohort until all your pre-course work is completed.