Interactive JavaFX application to visualize and simulate graph algorithms (Dijkstra, A*, Bellman-Ford, MST, max flow) on transport networks with step-by-step execution.

A library for Java routing algorithm

Interactive pathfinding algorithm visualizer built with Spring Boot & HTML5 Canvas. Features BFS, DFS, Dijkstra, A* with real-time animation, maze generation, and 30+ unit tests.

Analyse de résilience réseau et optimisation de flux critiques. Simulateur de pathfinding (Dijkstra, A*) sur graphes et matrices d'intensités. Focus : Intégrité des chemins et architecture logicielle.

Benchmarking suite for A* vs SMA* pathfinding efficiency using Scikit-Learn ML Heuristics, with an interactive HTML5/Plotly analytics dashboard

A state-space search solver for the 5x5 puzzle using BFS, DFS, and A* with heuristic pruning and visited-state optimization.

This is a Java implementation of a Sudoku Cube GUI and an A* solver.

AI project solving 8-puzzle with horizontal, vertical and diagonal moves using UCS and A*, developed for my Artificial Intelligence course.

Tasks on Java.

This repository implements a solver for an extended 8-Puzzle game, where blocks can move diagonally, using Breadth-First Search (BFS) and A* search algorithms.

Algoritmo A* (estrella), práctica de búsqueda heurística sin adversarios

Integrated front-end and back-end system for vehicle dispatch, routing, pickup and delivery planning, and control simulation.

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

Solving N-Queens using Genetic Algorithm and PSO

ALT algorithms on a grid graph used for routing on the sea.

Algorithms and Data Structures project on different heaps and their use in the Dijkstra and A* algorithms

Finding a valid route between two cities using A-Star Search

Using an initial location and a goal location, the program solves for the path (based on the search algorithm chosen) based on locations of cities.

A maze solver capable of processing B&W maze images and finding paths through various path-finding algorithms.