Min Heap/Priority Queue: Extract Min (code visualization)
Computer Psychology - Joy Liu
Min Heap/Priority Queue: Extract Min (code visualization)
1:36
Heap Extract Max (code visualization)
Computer Psychology - Joy Liu
Heap Extract Max (code visualization)
1:26
Build a Min Heap/Priority Queue (code visualization)
Computer Psychology - Joy Liu
Build a Min Heap/Priority Queue (code visualization)
2:09
Build a Max Heap (code visualization)
Computer Psychology - Joy Liu
Build a Max Heap (code visualization)
2:09
The Fairy Tale of Algorithms: Kruskal's, Prim's (on Minimum Spanning Tree) #SoME2
Computer Psychology - Joy Liu
The Fairy Tale of Algorithms: Kruskal's, Prim's (on Minimum Spanning Tree) #SoME2
25:50
Why do we iterate V-1 times in Bellman-Ford algorithm?
Computer Psychology - Joy Liu
Why do we iterate V-1 times in Bellman-Ford algorithm?
2:28
Bellman-Ford Algorithm: visualize and explain in one video
Computer Psychology - Joy Liu
Bellman-Ford Algorithm: visualize and explain in one video
3:35
How does Bellman Ford Algorithm detect negative cycles?
Computer Psychology - Joy Liu
How does Bellman Ford Algorithm detect negative cycles?
3:15
Bellman-Ford Algorithm Code Visualization
Computer Psychology - Joy Liu
Bellman-Ford Algorithm Code Visualization
3:19
How to relax an edge?
Computer Psychology - Joy Liu
How to relax an edge?
1:34
Prim's vs Dijkstra's Algo
Computer Psychology - Joy Liu
Prim's vs Dijkstra's Algo
5:31
Why does Dijkstra's Algorithm fail on negative weights?
Computer Psychology - Joy Liu
Why does Dijkstra's Algorithm fail on negative weights?
1:35
Dijkstra's Algorithm in 3 mins
Computer Psychology - Joy Liu
Dijkstra's Algorithm in 3 mins
2:53
Dijkstra's Algorithm Code Visualization (with Priority Queue)
Computer Psychology - Joy Liu
Dijkstra's Algorithm Code Visualization (with Priority Queue)
3:23
Kruskal's Algorithm in 3 mins (with Union-Find)
Computer Psychology - Joy Liu
Kruskal's Algorithm in 3 mins (with Union-Find)
3:08
Amazing Grace Visualization | Graph Representation of the Melody
Computer Psychology - Joy Liu
Amazing Grace Visualization | Graph Representation of the Melody
1:51
Kruskal's Algorithm Code Visualization (with Union Find)
Computer Psychology - Joy Liu
Kruskal's Algorithm Code Visualization (with Union Find)
3:29
Kruskal's Algorithm in 3 mins
Computer Psychology - Joy Liu
Kruskal's Algorithm in 3 mins
2:10
Kruskal's Algorithm Code Visualization
Computer Psychology - Joy Liu
Kruskal's Algorithm Code Visualization
2:59
Prim's Algorithm in 3 mins (with Priority Queue)
Computer Psychology - Joy Liu
Prim's Algorithm in 3 mins (with Priority Queue)
2:56
Prim's Algorithm Code Visualization (with Priority Queue)
Computer Psychology - Joy Liu
Prim's Algorithm Code Visualization (with Priority Queue)
3:08
Prim's Algorithm in 2 mins
Computer Psychology - Joy Liu
Prim's Algorithm in 2 mins
1:55
Prim's Algorithm Code Visualization
Computer Psychology - Joy Liu
Prim's Algorithm Code Visualization
1:45
Operations on Heaps | Big Picture (insert, delete, extract, build_heap, heapify)
Computer Psychology - Joy Liu
Operations on Heaps | Big Picture (insert, delete, extract, build_heap, heapify)
9:20
堆：几种操作的关系 | Big picture | insert, delete, extract, build_heap, heapify
Computer Psychology - Joy Liu
堆：几种操作的关系 | Big picture | insert, delete, extract, build_heap, heapify
8:27
什么是堆(Heap) | 堆的性质 | 数组实现
Computer Psychology - Joy Liu
什么是堆(Heap) | 堆的性质 | 数组实现
9:44
What is a heap | Array representation
Computer Psychology - Joy Liu
What is a heap | Array representation
9:03
Recursion tree method | T(n) = 2T(n/4) + sqrt(n)
Computer Psychology - Joy Liu
Recursion tree method | T(n) = 2T(n/4) + sqrt(n)
11:33
Zoom university is not that bad (for fun)
Computer Psychology - Joy Liu
Zoom university is not that bad (for fun)
6:42