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

Floyd-Warshall

Chen
November 17, 2022
Science
0
87

 Floyd-Warshall

Chen

November 17, 2022
Tweet

More Decks by Chen

See All by Chen
Example ROP in MIPS
tiffany_04192
0
50
defense
tiffany_04192
0
71
Dijkstra’s Algorithm
tiffany_04192
0
110
Topological sort DFS
tiffany_04192
0
86
BFS
tiffany_04192
0
120
DFS
tiffany_04192
0
95
Cache behavior
tiffany_04192
0
81
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
100

Other Decks in Science

See All in Science
学術講演会中央大学学員会いわき支部
tagtag
0
120
Valuable Lessons Learned on Kaggle’s ARC AGI LLM Challenge (PyDataGlobal 2024)
ianozsvald
0
200
科学で迫る勝敗の法則(名城大学公開講座．2024年10月) / The principle of victory discovered by science (Open lecture in Meijo Univ. 2024)
konakalab
0
260
【健康&筋肉と生産性向上の関連性】 【Google Cloudを企業で運用する際の知識】 をお届け
yasumuusan
0
440
ほたるのひかり/RayTracingCamp10
kugimasa
1
500
地表面抽出の方法であるSMRFについて紹介
kentaitakura
1
240
白金鉱業Meetup Vol.15 DMLによる条件付処置効果の推定_sotaroIZUMI_20240919
brainpadpr
2
670
重複排除・高速バックアップ・ランサムウェア対策 三拍子そろったExaGrid × Veeam連携セミナー
climbteam
0
180
ガウス過程回帰とベイズ最適化
nearme_tech
PRO
1
150
Factorized Diffusion: Perceptual Illusions by Noise Decomposition
tomoaki0705
0
310
構造設計のための3D生成AI－最新の取り組みと今後の展開－
kojinishiguchi
0
800
統計学入門講座 第1回スライド
techmathproject
0
210

Featured

See All Featured
Typedesign – Prime Four
hannesfritz
40
2.5k
The Art of Programming - Codeland 2020
erikaheidi
53
13k
BBQ
matthewcrist
86
9.4k
The Web Performance Landscape in 2024 [PerfNow 2024]
tammyeverts
4
380
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
160
15k
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
6
530
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
3.7k
Faster Mobile Websites
deanohume
306
31k
Documentation Writing (for coders)
carmenintech
67
4.6k
The MySQL Ecosystem @ GitHub 2015
samlambert
250
12k
A Tale of Four Properties
chriscoyier
158
23k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
98
18k

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