onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2026-04-16 11:33:34 +00:00
Code Issues Packages Projects Releases Wiki Activity

add some notes

Browse Source
This commit is contained in:
onyx-and-iris
2024-01-19 17:21:42 +00:00
parent 0f52cf0f75
commit 1da4a16ec8
5 changed files with 23 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
chapter9/README.md Normal file
View File

@@ -0,0 +1,5 @@
# Shortest path for weighted graph (cost associated edges)
- Dijkstra's algorithm works when all weights are non-negative
- If there are negative weights use Bellman-Ford.
- Priority queue + min heap is optimal when compared to a function that operates on a list.