Shortest Path finder for wandering Traveller using Dijikstra's Algorithm
-
Updated
Jul 16, 2018 - Java
Shortest Path finder for wandering Traveller using Dijikstra's Algorithm
Implementation of maze generation algorithms and shortest pathfinding algorithms in a matrix with obstacles (with GUI)
A command line Java program developed for an artificial intelligence college course. It applies the Shortest Path Problem to a graph of fictitious cities. It uses either Best First Search or Uniform Cost Search to provide the shortest path from one city in the graph to another.
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
Maglev is a library that provides fast and generic solutions for shortest path problems (SPP)
Graph & Network Algorithms.
Simple application that can navigate obstacles to find the shortest path on a grid using Dijkstra and A Star.
Add a description, image, and links to the shortest-path-problem topic page so that developers can more easily learn about it.
To associate your repository with the shortest-path-problem topic, visit your repo's landing page and select "manage topics."