dijikstra-algorithm

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.

This repository provides the implementaion of data structures in Java programming langauge

An educational social networking API powered by Java Spring Boot. Features a custom recommendation engine that implements Graphs, B+ Trees, Tries, LRU Caches, and Min-Heaps without relying on built-in Java collections.

The ride-sharing simulation replicates services like Uber or Lyft, analyzing user demand, driver availability, and pricing dynamics for optimization.

Base project for the "Aegis" system. This repository contains custom data structures (LinkedList, Stack, MinHeap) and core graph algorithms (Dijkstra, Tarjan's) built from scratch in pure Java. This project serves as the foundational logic engine for a Spring Boot API.

The Smart Vehicle Traffic System uses Dijkstra's algorithm in C++ (via JNI) to simulate real-time vehicle navigation, visualized through Phaser.js with traffic signals and collision avoidance.

Fill-in puzzle that takes the dimensions, words and their placeholder as an input and outputs a valid solution (if the given puzzle has one)

Using Dijkstra's algorithm to find the closest path

This is an extension of the webpage similarity II project. This time, the GUI would include a section that allows you two find the path (wiki links) between any two different wiki link that you select from our database.

Finding the shortest route between points on a city map

Java-based Delhi Metro Route Finder using Dijkstra's algorithm and Swing GUI.