Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.

Source codes for the Data Structures and Algorithms in C++ and Java book

Computer Science subject module at Roskilde University. Was made as part of a 15ETCS course where we applied Different Pathfinding strategies to solve shortest path problem. Contains Dijkstra and A* implemented in Java with a JavaFX User Interface to demonstrate shortest path visualization. Note: this project is not maintained

ᴛʜɪꜱ ɪꜱ ᴍʏ ꜱᴍᴀʟʟ ᴊᴀᴠᴀ ɢʀᴀᴅᴇᴅ ᴀꜱꜱɪɢɴᴍᴇɴᴛ ɢɪᴠᴇɴ ʙʏ ᴜᴘɢʀᴀᴅ

Implementation of various complex algorithms that are graph related and used in the real world applications.

Simple implementation of elementary data structures coded from the scratch in Java.

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*

DSA project- Implementation of an online pizza ordering system, using data structures and algorithms in Java

This project aims to take the shortest route to all selected cities and return to the starting city. It uses the dijikstra algorithm while calculating the shortest path.

A simple graph editor built for a university software engineering project.

Implementing Graph Algorithms in the Object-Oriented Programming Language: "Java"

The purpose of this project is to solve the shortest path problem, one of the fundamental theoretic problems known in graph theory, and how Dijkstra's algorithm can be used to solve it. Done as part of the final project for MOOC on Graph Theory by UCSD.

Maglev is a library that provides fast and generic solutions for shortest path problems (SPP)

Choose shortest path using Dijkstra algorithm

This module has some Advanced concepts and Programs related to Graph Theory in Java with program implementations

A social network and metro system representation - Shortest path problem

Usage of A*/Astar algorithm

Displays tracking information for the package delivery system.

Implementation of maze generation algorithms and shortest pathfinding algorithms in a matrix with obstacles (with GUI)