At its core, a pathfinding method searches a graph by starting at one vertex and exploring adjacent nodes until the destination node is reached, generally with the intent of finding the cheapest route.

There are many pathfinding algorithms, however, for this project I chose to use Dijkstra’s algorithm. Dijkstra’s algorithm is a weighted search algorithm that guarantees the shortest path between nodes on a weighted or unweighted graph.

Technologies used: React, Javascript

You can find a link to the github repository for this project here.

</body>

</html>

Menu

<html>

<body>

P

a

t

h

f

i

n

d

i

n

g

At its core, a pathfinding method searches a graph by starting at one vertex and exploring adjacent nodes until the destination node is reached, generally with the intent of finding the cheapest route.

There are many pathfinding algorithms, however, for this project I chose to use Dijkstra’s algorithm. Dijkstra’s algorithm is a weighted search algorithm that guarantees the shortest path between nodes on a weighted or unweighted graph.

Technologies used: React, Javascript

You can find a link to the github repository for this project here.

</body>

</html>

<html>

<body>

P

a

t

h

f

i

n

d

i

n

g

At its core, a pathfinding method searches a graph by starting at one vertex and exploring adjacent nodes until the destination node is reached, generally with the intent of finding the cheapest route.

There are many pathfinding algorithms, however, for this project I chose to use Dijkstra’s algorithm. Dijkstra’s algorithm is a weighted search algorithm that guarantees the shortest path between nodes on a weighted or unweighted graph.

Technologies used: React, Javascript

You can find a link to the github repository for this project here.