Questions tagged [dijkstra]
This tag should be used for questions that involve Dijkstra's algorithm.
14
questions
1
vote
2
answers
470
views
Find the cheapest flight to reach from source to destination
As the input you get the flight schedule as an array, each element of which is the price of a direct flight between 2 cities ...
- 133
1
vote
2
answers
158
views
Finding the cheapest path between two points using Dijkstra
I am trying to use Dijkstra to find the cheapest path between two pixels in an image.
Implementation:
...
- 143
3
votes
1
answer
158
views
Traditional vs. bidirectional Dijkstra's algorithm in C
I have this CLion project on GitHub. It constructs a directed, weighted graph consisting of 100 thousand nodes and 500 thousand directed arcs, picks two random nodes, and computes the shortest paths ...
- 27k
2
votes
0
answers
210
views
Dijkstra's Shortest Path Algorithm
Is there anything I could do better in this Dijkstra's Implementation. This is my implementation of Dijkstra after understanding the concept. I used hash table wherever possible to have faster access
<...
- 21
1
vote
1
answer
193
views
How can I avoid duplicate processing of vertices in the priorityqueue with Dijkstra?
So everytime a neighbors is discovered with an improved distance, it is added to the priorityqueue with the new distance (so it can be used in the right order). This means however that the old entry ...
- 143
1
vote
1
answer
103
views
Pathfinders.hpp - Dijkstra's algorithm
I have this Visual Studio 2022 project, in which I compared the performance of 4 point-to-point shortest path algorithms. This one presents the Dijkstra's algorithm:
...
- 27k
2
votes
2
answers
378
views
2
votes
0
answers
63
views
Dijkstra from scratch
I implemented the Dijkstra algorithm from scrath and wonder if I can save some code? The whole algorithm is here.
n is the number of nodes, and m the number of edges. 1 ≤ 𝑛 ≤ 10^4, 0 ≤ 𝑚 ≤ 10^5, 𝑢 ...
- 325
1
vote
0
answers
412
views
Dijkstra's shortest-path algorithm implemented via Priority Queues and an adjacency matrix represented graph
My adjacency matrix looks like this, where non-zero weights denote edges.
[0, 2, 0, 0, 3]
[2, 0, 2, 4, 0]
[0, 2, 0, 3, 0]
[0, 4, 3, 0, 1]
[3, 0, 0, 1, 0]
Here's my attempt, would appreciate a code ...
- 129
6
votes
1
answer
193
views
10
votes
2
answers
3k
views
Implementation of Dijkstra's algorithm in Python
I have implemented Dijkstra's algorithm for my research on an Economic model, using Python.
In my research I am investigating two functions and the differences ...
- 103
7
votes
2
answers
384
views
Dijkstra's implementation in rust
I would like to get any feedback about my implementation of Dijkstra algorithm in Rust following this youtube video.
Please be aware that this my first code in Rust as well as my first Dijkstra ...
- 171
7
votes
1
answer
943
views
Dijkstra algorithm C#
I have implementing a simple version of Dijkstra's algorithm in C#. Could this be made more efficient? Does it need to be modified?
...
- 79
2
votes
1
answer
318
views
LeetCode: Network Delay Time Dijkstra's Algorithm C#
https://leetcode.com/problems/network-delay-time/
There are N network nodes, labelled 1 to N.
Given times, a list of travel times as directed edges times[i] = (u,
v, w), where u is the ...
- 5,321