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
Floyd-Warshall
Search
Chen
November 17, 2022
Science
100
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
Floyd-Warshall
Chen
November 17, 2022
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
70
defense
tiffany_04192
0
92
Dijkstra’s Algorithm
tiffany_04192
0
130
Topological sort DFS
tiffany_04192
0
110
BFS
tiffany_04192
0
140
DFS
tiffany_04192
0
130
Cache behavior
tiffany_04192
0
98
Cache miss paper
tiffany_04192
0
120
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
データベース12: 正規化(2/2) - データ従属性に基づく正規化
trycycle
PRO
0
1.8k
20261012_hcmpl2026
takusamar
0
160
Anomalies de terrain remontées à l'ONAB
institutdelelevage
PRO
0
260
「念のためのログ保存」を組織全体でやめるためのポリシーと仕組み作り
i2tsuki
4
410
「AIエージェントを作る」とは、何を設計することか
salt2
0
230
不動産業界における業界特化のデータ整備とAI活用 ─Vertical DataとVertical AI─
estie
1
1.1k
言葉をはかる:テキストマイニング入門①講義編
satocos135
0
270
Kritische evaluatie van GenAI-output voor literatuuronderzoek
voginip
0
250
因果探索の発展と展望
sshimizu2006
2
1.2k
白金鉱業Meetup Vol.25 【初学者向け発表枠】「で、この施策って効いてるの」に答える効果検証の基礎 ~ATE / ATT / CATE / LATEを現場の問いに翻訳する~
brainpadpr
1
360
Conwayの法則を"ちゃんと"使うために — 原典でConwayは何を言っていたのか
bonotake
10
7.5k
生成AI時代のインタラクションサイエンス(招待講演)/interaction-science
okana2ki
0
110
Featured
See All Featured
Crafting Experiences
bethany
1
380
The Director’s Chair: Orchestrating AI for Truly Effective Learning
tmiket
1
330
Mind Mapping
helmedeiros
1
400
A Tale of Four Properties
chriscoyier
163
24k
Building a Scalable Design System with Sketch
lauravandoore
464
34k
Highjacked: Video Game Concept Design
rkendrick25
PRO
1
480
Bootstrapping a Software Product
garrettdimon
PRO
306
120k
Ten Tips & Tricks for a 🌱 transition
stuffmc
1
270
Bash Introduction
62gerente
615
220k
From Legacy to Launchpad: Building Startup-Ready Communities
dugsong
0
360
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
162
16k
Visualizing Your Data: Incorporating Mongo into Loggly Infrastructure
mongodb
50
10k
Transcript
Floyd-Warshall: Dynamic Programming Floyd-Warshall computes all pairs, but let us
focus on 5 to 6. 62 / 71
Floyd-Warshall: Dynamic Programming We start by considering only start(5) and
dest(6) when k is 0. 63 / 71
Floyd-Warshall: Dynamic Programming Then we also consider node 1 when
k is 1. 64 / 71
Floyd-Warshall: Dynamic Programming And node 2 when k is 2.
65 / 71
Floyd-Warshall: Dynamic Programming And node 3 when k is 3.....
66 / 71
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
Floyd-Warshall: Dynamic Programming Hmm it looks like some of those
recursive calls will recompute the same thing... 68 / 71