Pathfinding Algorithms Visualizer

(School context) - Java implementation of Dijkstra and Warshall algorithms

best zeppelin movement between two positions with dijkstra algorithm

This maze solver is based on the Dijkstra algorithm. Each free cell being considered as a node, and each full cell being considered as a node located at infinite distance from all empty cells. The entire algorithm (including the 10 extras) has been hand-coded in Java, with an object-oriented method including a very rigorous architecture.

Usage of A*/Astar algorithm

A Java implementation of the Dijkstra`s shorter path finding algorithm

Pathfinder in CFF network using Dijkstra and Floyd

[COURSE] Implementation examples of some Java based data structures

HexGame usign Min-Max alpha beta pruning with dijkstra and multithreading optimized

The aim of this repository is to provide an insight about algorithms in general.

A JavaFX graphical implementation that computes the best path between two metro stations in the public transport network of Brussels.

A simple time-based pathfinding program

Programming a AI to play and collect pearls in a diving game tournament

Weighted graphs 2nd semester, 12th exercise. Computer science.

Find the shortest path between two nodes in an undirected graph using Applets

Jeu de type rogue-like/rythme inspiré du célèbre jeu Crypt of the NecroDancer.

Simulador de redes de computadores, que permite a exibição da menor rota (considerando seus custos) entre dois nós. O sistema provê computadores e roteadores para a utilização e permite diversas operações entre esses equipamentos: como a visualização de menor caminho entre os dois terminais, visualização de menor caminho de um para todos os outr…

Maze Solver with GUI (SWING) implementation for a university project. The project was created together with Martyna Kochalska (pyskaa0506)

Packman eat fruits in the shorest path