Introduction to the Travel Planner Project

What is the project about?

In this chapter we'll build a more advanced project that focuses on graph and algorithm concepts—a working knowledge of these concepts will be helpful. In this project, there will be an HTML web page, on which we will render two components—cities and their connecting routes. The routes between each of the cities are in the form of a graph. Each route (edge) will have a weight associated with the distance from the source city to the destination city. There can be two types of routes to reach from city A to city B:

1. The route shown in orange depicts the road route.

2. The route shown in red depicts the air route.

This project aims to find the shortest path between two cities selected randomly out of a list of cities. However, there is one restriction we need to apply: we can use an air route only once to reach another city. We are not allowed to take more than one air route. It can also be possible that we can reach the city by taking the shortest path without any air route involved.

You can view the completed project below: