Dijkstra

In the world of Climb King, adventurers flock to a mysterious tower, aiming to reach its top and have their wishes granted. The tower comprises multiple floors, each with its own layout of locations, paths, and keys. I am trying to help the adventurers find the optimal route to climb the tower as fast as possible.

A full-stack prototype for finding optimal paths based on user preference and circumstance, using the A* algorithm and knowledge representation in RDF/TTL.

Implementation of the Dijkstra Algorithm to find the shortest path between two summits. This algorithm is very useful if you want to know the shortest route between two cities for example.