Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).

Simple demonstration of the Dijkstra algorithm

Maze Solver is an interactive Java-based tool designed to visualize and compare the performance of various pathfinding algorithms.

App creates airplanes which will fly through airports. Every airplane can have different range. If airplane can't reach airport immediately, it will search for the shortest path to this airport.

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (BMSSP) algorithm - Java implementation

Academic Projects – Web, desktop, and algorithmic apps built during my Master's in Computer Applications

This is a sophisticated Java-based flight management system developed as a final project for the Data Structures and Algorithm Analysis course. The application simulates a Colombian airline system that uses graph theory and classic algorithms to solve real-world flight management problems.

Set of tools for working with Data structures 🧰​🔧

A Command Line Interface (CUI) Delhi Metro application in Java utilizing graph algorithms like Dijkstra’s, DFS, and BFS for route finding, fare calculation, and network exploration.

Questions which i practice in Graph Chapter, approaches and algos.

Data structure and Algorithms, Java workouts ,Problem Solving questions and solutions.(Repository contains major Graph alogirthms like Bellmanford algo,Prim's ,Dijkstra's algorithm).

My implementation of Dijkstra algorithm

This project simulates real bus transportation systems, analyzes route structures and builds the base for shortest path / trip planning algorithms by using Directed Graph Data Structure and Dijkstra Algorithm.

The objective of this exercise is to implement **Dijkstra's Algorithm** to find the shortest path in a weighted graph .

Six degrees of separation theory research

A modern take on the classic Snake game featuring an AI opponent that uses Dijkstra's algorithm for pathfinding. Customize snake colors and game speed while competing against an intelligent AI snake.

A Java-based project that visualizes a traffic management system using graph structures and JavaFX. It demonstrates node and edge representation for traffic flow between locations, providing an interactive and visual approach to understanding connectivity.

Ce rapport a permis de comparer deux versions de l'algorithme de Dijkstra : une implémentation naïve et une implémentation optimisée par GraphStream.

Shortest flight path between two airports