Implement Dijkstra's Algorithm for Shortest Path #89
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
![staging-devin-ai-integration[bot]](https://avatars.githubusercontent.com/in/870844?s=60&v=4){kind=small}
|
add a funny story |
marcosfede
reviewed
Aug 26, 2024
graph/dijkstra.py
Outdated
Comment on lines
37
to
43
| graph = { | ||
| 0: [(1, 4), (2, 1)], | ||
| 1: [(3, 1)], | ||
| 2: [(1, 2), (3, 5)], | ||
| 3: [(4, 3)], | ||
| 4: [] | ||
| } |
marcosfede
reviewed
Aug 26, 2024
| start (int): The starting node. | ||
|
|
||
| Returns: | ||
| Dict[int, int]: A dictionary with nodes as keys and shortest distances from start as values. |
There was a problem hiding this comment.
add some more comments under this line
Comment on lines
+53
to
+62
| complex_graph = { | ||
| 0: [(1, 4), (2, 2)], | ||
| 1: [(2, 1), (3, 5)], | ||
| 2: [(3, 8), (4, 10)], | ||
| 3: [(4, 2), (5, 6)], | ||
| 4: [(5, 3)], | ||
| 5: [(6, 1)], | ||
| 6: [(4, 4), (7, 2)], | ||
| 7: [] | ||
| } |
There was a problem hiding this comment.
add an even more complex graph
|
test comment |
|
Closing due to inactivity. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implement Dijkstra's Algorithm for Shortest Path
This pull request adds an implementation of Dijkstra's algorithm to the
algorithmsrepository. Dijkstra's algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge weights.Changes
Added
graph/dijkstra.py:dijkstrafunction that takes a graph represented as a dictionary and a start node.__main__section.Added
graph/test_dijkstra.py:dijkstrafunction.Implementation Details
The algorithm uses a priority queue (implemented with Python's
heapqmodule) to efficiently select the next node to process. This ensures an optimal time complexity of O((V + E) log V), where V is the number of vertices and E is the number of edges in the graph.Testing
The implementation has been thoroughly tested with various graph configurations to ensure correctness and robustness. All tests are passing.
Next Steps
This implementation was created as part of a Devin run. You can find the details of the run here: https://staging.itsdev.in/devin/972023a91df94403a18c3e6f869b61a4
@federico, could you please review this implementation and provide any feedback or suggestions for improvement? Thank you!
If you have any feedback, you can leave comments in the PR and I'll address them in the app!