GitHub

Shortest Path Finder - Dijkstra's Algorithm

This is a web-based application that finds the shortest path between two nodes in a weighted graph using Dijkstra's Algorithm. Users can input graph data in a specified format and visualize the ...
GitHub

Shortest-Path-using-Dijkstra-Algorithm

"DETERMINATION OF THE SHORTEST PATH IN THE UMS MAIN CAMPUS USING THE DIJKSTRA ALGORITHM" This project applies Dijkstra’s algorithm, a graph-based optimization method, to determine the shortest walking ...
IEEE

Optimizing Dijkstra’s Algorithm: Enhancing Pathfinding Efficiency Through Heuristics and Structural Techniques

Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...
IEEE

Shortest Path Finding using Modified Dijkstra’s algorithm with Adaptive Penalty Function

Abstract: Path finding is a technique that is employed extensively for determination of Shortest Path (SP) between source node and destination node. There are various path-finding algorithms like ...