Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Floyd-Warshall

Chen
November 17, 2022
Science
0
77

 Floyd-Warshall

Chen

November 17, 2022
Tweet

More Decks by Chen

See All by Chen
Example ROP in MIPS
tiffany_04192
0
30
defense
tiffany_04192
0
69
Dijkstra’s Algorithm
tiffany_04192
0
97
Topological sort DFS
tiffany_04192
0
79
BFS
tiffany_04192
0
86
DFS
tiffany_04192
0
88
Cache behavior
tiffany_04192
0
74
Cache miss paper
tiffany_04192
0
96
Greedy
tiffany_04192
0
88

Other Decks in Science

See All in Science
Yasuke
drawsbygba
0
610
Machine Learning for Materials (Lecture 7)
aronwalsh
0
730
JSol'Ex : solar image processing in Java
melix
0
240
量子コンピュータとデータサイエンティスト
fuyu_quant0
0
130
AI(人工知能)の過去・現在・未来 —AIは人間を超えるのか—
tagtag
0
230
Mastering Feature Engineering: Mining the Hidden Salary Formula with CakeResume
tlyu0419
0
130
Machine Learning for Materials (Lecture 4)
aronwalsh
0
670
Direct Preference Optimization
zchenry
0
130
効果検証入門に物申してみた_JapanR_2023
s1ok69oo
6
4.5k
『データ可視化学入門』を PythonからRに翻訳した話

bob3bob3
1
360
Pokemon Roughs
shoryuuken
0
370
Transformer系機械学習モデルを取り巻くライブラリや用語を整理する
bobfromjapan
2
480

Featured

See All Featured
Designing on Purpose - Digital PM Summit 2013
jponch
110
6.4k
Navigating Team Friction
lara
177
13k
Thoughts on Productivity
jonyablonski
57
3.8k
How GitHub Uses GitHub to Build GitHub
holman
468
290k
ParisWeb 2013: Learning to Love: Crash Course in Emotional UX Design
dotmariusz
104
6.6k
Bash Introduction
62gerente
604
210k
Infographics Made Easy
chrislema
238
18k
Building Effective Engineering Teams - LeadDev
addyosmani
28
1.8k
Art, The Web, and Tiny UX
lynnandtonic
288
19k
[RailsConf 2023 Opening Keynote] The Magic of Rails
eileencodes
9
8.3k
How to train your dragon (web standard)
notwaldorf
72
5.1k
Automating Front-end Workflow
addyosmani
1355
200k

Transcript

  1. Floyd-Warshall: Dynamic Programming Floyd-Warshall computes all pairs, but let us

    focus on 5 to 6. 62 / 71

  2. Floyd-Warshall: Dynamic Programming We start by considering only start(5) and

    dest(6) when k is 0. 63 / 71

  3. Floyd-Warshall: Dynamic Programming Then we also consider node 1 when

    k is 1. 64 / 71

  4. Floyd-Warshall: Dynamic Programming And node 2 when k is 2.

    65 / 71

  5. Floyd-Warshall: Dynamic Programming And node 3 when k is 3.....

    66 / 71

  6. Floyd-Warshall: Dynamic Programming And node 4 when k is 4....

    And so on. Note that I have just been filling in the answers for recursive calls But we actually need to compute those. 67 / 71

  7. Floyd-Warshall: Dynamic Programming Hmm it looks like some of those

    recursive calls will recompute the same thing... 68 / 71