Path Finding Algorithms With JavaScript

This course will help you understand path finding, and will assist you in implementing it in JavaScript.

We will cover how to create a grid from scratch and implement our very own path finding algorithm.

By the end of this course you’ll have mastered the path finding algorithms available using javascript.

You will be able to create fast applications ( and reliable ) by using the best path finding algorithms. The codebases are open source, I’m going to guide you on how to implement them and how create your very own visualization app.

All lessons taught in this course are going to be valuable in your future learning, and you can have a really impressive project at your portfolio by the end of it. So what are you waiting for ? 

Let’s get started!

WHAT IS PATH FINDING ?

Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra’s algorithm for finding the shortest path on a weighted graph.

Pathfinding is closely related to the shortest path problem, within graph theory, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc) between two points in a large network.