Graph Traversal Algorithms
The Graph Traversal Algorithms BFS and DFS are some of the most fundamental algorithms in graph theory. In this video, we will investigate the large application range of these algorithms as well as their implementations.
Analytics
Comments
Lovely graphics and overall level of production. In the Great Hall of Math Visualization, you deserve to sit at the same table as Grant Sanderson himself. I wish I knew some graph theory so that I could measure the quality of this presentation against my own understanding of the material, but as matters stand, I can't really appreciate any special insights conveyed by this approach. It seems to do the job well. Should I ever develop the graph theory bug, I will surely return to the series of which this video is a part. Thank you for making these.
8.5I liked the Vid, very clear and well chosen graphics. Interesting topic. My main criticism is that it appears to me a litte monotone. You have a good explanation voice, but every now and then it is good for the attention to add a litte emotional involvement. (I know this is difficult bit it pays off to think about those elements as well)
6.5Voting as "about the same" A good video. The subject was clear, and the BFS and DFS algorithms were explained well. Liked the detailed animations showing how they work. I would've voted this higher but it was let down by it being the third in a series rather than a standalone video. You mention chapter 1 in a couple of places. I wanted to pause and go off to have a look but the SOMEpi interface makes this difficult
4.9Goal Orientation: 5/10 Novelty: 1/10 Thought-Provoking: 2/10 Comprehensibility: 4/10 Technological: 9/10 Overall Average: 4.2/10
4.8Very well explained on what the algorithms are as well as use cases and an implementation. This is definitely a gold standard in terms of the level of detail in terms of clarity here. I liked that steps were shown with examples animated. Given this level of detail and of showing the solution, the authors can encourage the viewers to think about the problem explicitly to find a solution and to show them after the thought process for better engagement.
8.6