D

Dijkstra

An implementation of the Dijkstra algorithm using Go Generics (Work In Progress)

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.

Simple A* implementation in R6RS Scheme

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

University project assignment from the module Algorithms, Data Structures & Complexities

Find the shortest paths in a graph.

Pathfinder algorithm written in typescript. Uses all the power of Dijkstra algorithm.

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.

Graphen und Wegfindung-Algorithmen

Console C# Dijkstra pathfinding project on graphs.