Do it yourself
In the previous section, we discussed the differences between the DFS and BFS algorithms. In this section, we'll look at an application that you can try to develop yourself. We'll go over the application that you'll try to develop, and the changes that are required for the application.
Your aim will be to develop a university navigation application, as shown in the following diagram:
Figure 20
Suppose that this is the layout of the university, and people can travel along horizontal or vertical lines. In this application, the user has to enter the source and destination places. For this specific case, we'll assume that a new student wants to find his way from the Bus Stop to the AI Lab.
You can refer to the classes that we developed for the LinkedIn connection feature, as follows:
Figure 21
To adapt that code for this application, we need to change the State class and the graph data. In the State class, the name property is replaced with the place property, and NavigationData contains...
