10 6 Topological Sort 22 min

  Рет қаралды 19,900

Stanford Algorithms

Stanford Algorithms

Күн бұрын

Пікірлер: 8
@bahabouali6886
@bahabouali6886 4 ай бұрын
who came here from leetcode
@mrwanderer14
@mrwanderer14 4 жыл бұрын
12:25 topological sort - DFS
@tenthlegionstudios1343
@tenthlegionstudios1343 3 жыл бұрын
I have gone through about 4 or 5 data structures and algorithm books/series throughout my programming career for interviewing. Your 4 part book series with the youtube videos, and website, are by far the best. Simple explanation with great examples. Quizes in the books and lectures to ensure understanding and learning. This book series will be my number one suggestion from now on for DS and Algorithms. Please come out with an advanced series as well! Suffix arrays, LCP, compressed tries, and more. I find learning about these topics more difficult as the books tend to be too mathematical for me to easily digest, and the video series's too sporadic. For instance, the MIT video on compressed tries (SA) explains the DC3 algorithm somewhat, but from the explanation I couldnt implement it on my own and needed to watch 4 other videos on it. As well as read the papers on its implementation.
@kuan-chunlee9611
@kuan-chunlee9611 3 жыл бұрын
Thanks for the great course. but It seems that there is a lag of the content to the speech.
@jonathanlee8162
@jonathanlee8162 2 жыл бұрын
yea a little lag between the voice and the slides
@toantruong9533
@toantruong9533 7 жыл бұрын
Thank you for this amazing course.
@jonathanlee8162
@jonathanlee8162 2 жыл бұрын
What if there is a second localized sink vertex? eg one with only 2 levels and another sink vertex with level 10. The algorithm may end up labeling level 2 sink vertex as 10
@ruslankhametov9095
@ruslankhametov9095 6 жыл бұрын
Excellent course, but I wish examples were much more complicated to better understand explained concepts/ideas
10   7   Computing Strong Components  The Algorithm 29 min
29:22
Stanford Algorithms
Рет қаралды 15 М.
Topological Sort Algorithm | Graph Theory
14:09
WilliamFiset
Рет қаралды 474 М.
How Many Balloons To Make A Store Fly?
00:22
MrBeast
Рет қаралды 149 МЛН
Players push long pins through a cardboard box attempting to pop the balloon!
00:31
快乐总是短暂的!😂 #搞笑夫妻 #爱美食爱生活 #搞笑达人
00:14
朱大帅and依美姐
Рет қаралды 13 МЛН
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
13:50
take U forward
Рет қаралды 267 М.
Lecture 14: Depth-First Search (DFS), Topological Sort
50:31
MIT OpenCourseWare
Рет қаралды 452 М.
Topological Sort | Kahn's Algorithm | Graph Theory
13:32
WilliamFiset
Рет қаралды 129 М.
10   1   Graph Search   Overview 23 min
23:20
Stanford Algorithms
Рет қаралды 15 М.
G-21. Topological Sort Algorithm | DFS
13:30
take U forward
Рет қаралды 333 М.
G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
26:36
take U forward
Рет қаралды 242 М.
10. Depth-First Search
52:23
MIT OpenCourseWare
Рет қаралды 36 М.
How Many Balloons To Make A Store Fly?
00:22
MrBeast
Рет қаралды 149 МЛН