GitHub

Visualize pixel maps or mazes, and test Dijkstra/A* algorithms to find the shortest path between two points on the map. This project is part of a biannual report for Paris ...

This project is an exercise that forms part of the semester report in the Advanced Algorithms course. It introduces the basics of graphs and shortest path search algorithms for weighted graph, which ...
GitHub

teeganRodgers/Graph-Algorithms-Implementing-BFS-and-Dijkstra-s-Algorithm

This project is an implementation of several fundamental graph traversal and pathfinding algorithms in Java. It was completed as part of the CS 314: Data Structures course at The University of Texas ...
IEEE

Al Driven Shortest Path Optimization in Tourist Applications using Dijkstra's Algorithm

Abstract: Aim: The objective of this study is to compare the efficacy of a recommendation-based algorithm with an Al-driven method that uses Dijkstra's Algorithm for shortest path optimization in ...