Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
Dijkstra’s Algorithm
Search
Chen
November 17, 2022
Science
130
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
Dijkstra’s Algorithm
Chen
November 17, 2022
Transcript
7 slides
Dijkstra’s Algorithm Do Dijkstra’s on this graph, starting from A.
Best distance to A: 0 All other nodes: 1 (so far, unreachable) 52 / 71
Dijkstra’s Algorithm A is done. Choose shortest total distance (B
at distance 3) From B, find a better path to C (3+3=6) Path to A is worse (3+3, worse than 0) 53 / 71
Dijkstra’s Algorithm B is done. Choose shortest total distance (F
at distance 4) Better path to E (4+5=9) Worse paths to A (4+4 vs 0) and D (4+2=6 vs 5) 54 / 71
Dijkstra’s Algorithm F is done. Choose shortest total distance (D
at distance 5) Better path for E (5+3 = 8 vs 9) Worse paths for other nodes 55 / 71
Dijkstra’s Algorithm D is done. Choose shortest total distance (C
at distance 6) Better path to E (6+1 = 7 vs 8) Worse paths to B and D 56 / 71
Dijkstra’s Algorithm C is done. Choose shortest total distance (E
at distance 7) Worse paths everywhere 57 / 71
Dijkstra’s Algorithm All nodes are done. Note we could have
recorded paths in table Also could stop early if we only wanted a single destination. 58 / 71
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
72
defense
tiffany_04192
0
93
Floyd-Warshall
tiffany_04192
0
110
Topological sort DFS
tiffany_04192
0
110
BFS
tiffany_04192
0
140
DFS
tiffany_04192
0
130
Cache behavior
tiffany_04192
0
100
Cache miss paper
tiffany_04192
0
130
Greedy
tiffany_04192
0
120
Other Decks in Science
See All in Science
[Relay webinaire eBIS actu n°16] Amélioration de la survie des JB avec la génétique - Introduction
institutdelelevage
PRO
0
460
チュートリアル:世界モデル
hf149
0
2.5k
JPA2026_NetworkSymposium_Shimotsukasa
junkashihara
0
120
勾配流から乖離した学習ダイナミクス
hanbao
1
1.2k
サンプル対応のない複数遺伝子発現プロファイルに対するテンソル分解型統合解析の要約
tagtag
PRO
0
290
[Relay webinaire eBIS actu n°16] Conclusion
institutdelelevage
PRO
0
310
Wet Active Matter
rajeshrinet
0
280
因果探索の発展と展望
sshimizu2006
2
1.3k
生成AI・プレプリント時代における 研究成果公開の再設計 ― トップカンファレンス文化はどこへ向かうのか / Redesigning the Dissemination of Research Outputs in the Age of Generative AI and Preprints — Where Is the Top-Conference Culture Heading?
ykiyota
0
31k
人工知能のための哲学塾 ニューロフィロソフィ篇 第一夜 「無著、世親と唯識のはじまり、ニューラルネットワークのはじまり」
miyayou
0
150
Massey Ratings for Match Outcome Prediction in Table Tennis: Evidence of Greater Stability than the ITTF World Ranking
konakalab
0
200
JPA2026_NetworkSymposium_Kashihara
junkashihara
0
130
Featured
See All Featured
Evolving SEO for Evolving Search Engines
ryanjones
0
360
GitHub's CSS Performance
jonrohan
1033
470k
Neural Spatial Audio Processing for Sound Field Analysis and Control
skoyamalab
0
620
What Being in a Rock Band Can Teach Us About Real World SEO
427marketing
0
1.1k
A Guide to Academic Writing Using Generative AI - A Workshop
ks91
PRO
1
570
Groundhog Day: Seeking Process in Gaming for Health
codingconduct
0
480
RailsConf 2023
tenderlove
30
1.6k
The AI Revolution Will Not Be Monopolized: How open-source beats economies of scale, even for LLMs
inesmontani
PRO
3
3.8k
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
230
23k
My Coaching Mixtape
mlcsv
0
390
The Pragmatic Product Professional
lauravandoore
37
7.5k
A Soul's Torment
seathinner
9
3.9k