Coding Example: Find shortest path in a maze
In this lesson, we will look how to find the shortest path in a maze.
We'll cover the following
Problem Description
Path finding is all about finding the shortest path in a graph. This can be split in two distinct problems:
- To find a path between two nodes in a graph
- To find the shortest path.
We’ll illustrate this through path finding in a maze. The first task is thus to build a maze!
Get hands-on with 1400+ tech skills courses.