GitHub

Computer Networks - Lab 2: Dijkstra's Algorithm: Finding the Shortest Path

This repository contains comprehensive implementations of Dijkstra's shortest path algorithm in three programming languages (C++, Python, and Dart) for the Computer Networks lab. The project includes ...
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 ...
Scientific Research Publishing

Dijkstra, E.W. (1959) A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269-271.

ABSTRACT: With the deepening of global economic integration, maritime logistics has become the core pillar of international trade, carrying more than 80% of global trade volume. Among the factors ...
Frontiers

A novel reinforcement learning framework-based path planning algorithm for unmanned surface vehicle

Unmanned surface vehicles (USVs) nowadays have been widely used in ocean observation missions, helping researchers to monitor climate change, collect environmental data, and observe marine ecosystem ...
Scientific Research Publishing

Optimization of Urban Traffic Through Integration of Dijkstra’s Algorithm with Edge Computing ()

1 Department of Industrial Engineering and Maintenance, Polytechnic University of Mongo, Mongo, Chad. 2 Department of Technical Sciences, University of N’Djamena, N’Djamena, Chad. 3 Department of ...
GitHub

shortest-path-problem

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* ...