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

Java实现Dijkstra及图

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

A Java-based pathfinding application that implements Dijkstra's algorithm to find the shortest route between two locations on a weighted graph.

上海市旅游景点导游程序 是一个基于Java Swing的智能旅游导览系统，专为优化上海本地及游客的出行体验设计。系统内置30个上海核心景点的详细信息及300+条真实交通网络数据，支持多维查询、动态成本计算及离线运行，为用户提供高效、直观的行程规划工具。

Simple demonstration of the Dijkstra algorithm

This Java application is an interactive command-line tool that demonstrates and compares two classic pathfinding algorithms: Dijkstra's algorithm for weighted graphs and Floodfill (Breadth-First Search) for unweighted graphs. The program finds the optimal path between two user-defined points on a 2D grid composed of various terrain types.

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

An interactive tool that shows the shortest path of a graph using dijkstra algorithm.

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.

A DSA-focused Java project that simulates the Delhi Metro network using graphs and heaps. Computes shortest routes and fares between stations using Dijkstra and BFS algorithms. Includes a CLI interface and interactive map for route visualization.

My implementation of Dijkstra algorithm