Mission 11: "Charting the Star Map" 🗺️
Before you can navigate the star map, you must first load its connection data into a usable format.
00:00
Mission Objective
Given a list of connections (`edges`), populate the `adjList`. For each edge `[u, v]`, you must add `v` as a neighbor of `u`, and `u` as a neighbor of `v`, since it's an undirected graph.
Step 1 / 2
1. The Story: The Mission Briefing
"The Labyrinth's navigation core is offline. You must map the local star cluster and find the shortest route to the central hub."
2. The Problem
How do you model a network and find the shortest path between two points?
3. The Task
You will represent the star map using an Adjacency List. Then, you will use Breadth-First Search (BFS), which explores level by level, to find the shortest path in terms of the number of jumps.
4. Concepts Applied
Graph representation, BFS for shortest path in unweighted graphs.