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
69
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
79
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
100

Other Decks in Science

See All in Science
Spectral Sparsification of Hypergraphs
tasusu
0
210
多次元展開法を用いた 多値バイクラスタリング モデルの提案
kosugitti
0
200
【人工衛星開発】能見研究室紹介動画
02hattori11sat03
0
160
構造設計のための3D生成AI－最新の取り組みと今後の展開－
kojinishiguchi
0
660
AI科学の何が“哲学”の問題になるのか　～問いマッピングの試み～
rmaruy
1
2.3k
はじめての「相関と因果とエビデンス」入門：“動機づけられた推論” に抗うために
takehikoihayashi
17
7k
(2024) Livres, Femmes et Math
mansuy
0
110
はじめてのバックドア基準：あるいは、重回帰分析の偏回帰係数を因果効果の推定値として解釈してよいのか問題
takehikoihayashi
2
990
Celebrate UTIG: Staff and Student Awards 2024
utig
0
510
化学におけるAI・シミュレーション活用のトレンドと 汎用原子レベルシミュレーター: Matlantisを使った素材開発
matlantis
0
320
マクロ経済学の視点で、財政健全化は必要か
ryo18cm
1
110
Pericarditis Comic
camkdraws
0
1.5k

Featured

See All Featured
How to Ace a Technical Interview
jacobian
276
23k
Building Flexible Design Systems
yeseniaperezcruz
327
38k
Easily Structure & Communicate Ideas using Wireframe
afnizarnur
191
16k
Raft: Consensus for Rubyists
vanstee
137
6.7k
Designing Experiences People Love
moore
139
23k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
97
17k
For a Future-Friendly Web
brad_frost
176
9.5k
Templates, Plugins, & Blocks: Oh My! Creating the theme that thinks of everything
marktimemedia
28
2.1k
Why Our Code Smells
bkeepers
PRO
335
57k
Learning to Love Humans: Emotional Interface Design
aarron
274
40k
Distributed Sagas: A Protocol for Coordinating Microservices
caitiem20
330
21k
GitHub's CSS Performance
jonrohan
1031
460k

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