Project: lb_pathfinder

A weighted graph is a data structure that represents a collection of nodes (e.g., cities) connected by edges (e.g., roads) that have a numerical value called a weight (e.g., distance). They are mostly used for pathfinding and optimization in various fields, including navigation, logistics, finance, and so on.

The objective of this project is to write a JavaScript script that finds the shortest travel itinerary between two interconnected cities.

General instructions

Here are the general instructions to complete this project:

1. The script must be named lb_pathfinder.js.

2. The script must be written in JavaScript.

Implementation

Here are the implementation details for this project: