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.
-
Updated
Sep 3, 2020 - Java
#
dijikstra-algorithm
Here are 7 public repositories matching this topic...
The ride-sharing simulation replicates services like Uber or Lyft, analyzing user demand, driver availability, and pricing dynamics for optimization.
java nginx spring-boot ridesharing tsp-problem k-means-clustering github-actions dijikstra-algorithm
-
Updated
Jul 2, 2024 - Java
This repository provides the implementaion of data structures in Java programming langauge
java graph vscode data-structures tree-structure dfs-algorithm intellij-idea bellman-ford-algorithm bfs-search dijikstra-algorithm
-
Updated
Jan 15, 2023 - Java
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.
visualization java algorithms cpp phaserjs traffic-simulation springbooot dijikstra-algorithm vehicle-simulation
-
Updated
Nov 29, 2024 - Java
Finding the shortest route between points on a city map
-
Updated
Aug 26, 2022 - Java
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.
-
Updated
Dec 14, 2023 - Java
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)
-
Updated
Aug 31, 2020 - Java
Improve this page
Add a description, image, and links to the dijikstra-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the dijikstra-algorithm topic, visit your repo's landing page and select "manage topics."