Alex7's blog

Finding Bridges Tutorial
By Alex7, history, 8 years ago, In English

So I just made this video, a tutorial for Tarjan's algorithm for finding bridges.

It's less than 6 mins long.

This video is an experiment, I tried a lot of new things and I'm waiting to see if you guys like it or not. I will continue to do my step by step videos, this might be a different series.

  • Vote: I like it
  • +99
  • Vote: I do not like it

Comments Comments (15)
| Write comment?
»
8 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

I always wondered why there aren't many channels about Competitive Programming. (Especially in English). I'm pretty sure any experienced coder setting up one would get him many views.

Keep adding more videos. Good job!

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Well, there are plenty of video lectures (from open courses) for algorithms and data structures.

    prakhar1989/awesome-courses#algorithms

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it +26 Vote: I do not like it

      I didn't see those, but I know that there are many lectures about data structures for academic purposes. They are sometimes useful, but there aren't many videos explaining things specially for competitive programming.

      → Reply
      • »
        »
        »
        »
        8 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        Yes, you are absolutely right. Sometimes finding good resources in text is already hard enough, but these open courses help more or less.

        I'd say this is partly due to the competitive nature of the scene. Plus practice and schoolwork take up a significant amount of time.

        I highly support Alex7 's initiative. The scene is really getting better and better with all of you nice people :)

        → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      This link is awesome lnishan. Thanks a lot.

      → Reply
»
8 years ago, # |
  Vote: I like it +17 Vote: I do not like it

It's awesome. Keep up the good work!

→ Reply
»
8 years ago, # |
  Vote: I like it +5 Vote: I do not like it

wow this is very helpful ! in addition to the fact that there is almost no good competitive programming channel on youtube.. I'm still a newbie at graph theory and I got it right away.. thank you so much for the wonderful tutorial :)

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Wow! I'm actually surprised that it's clear. Thank you for your feedback, I appreciate it a lot :D

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What I like about your video — Its very interesting to watch, because its short and to the point, you explained how to think it up from basic dfs, and the music too :) can you post a link to the music?

Please keep making such videos, they are great ice-breakers before picking up text resources to understand a new concept :)

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    This is one of the links. Youtube actually provides a library of open music/ sounds for video creators (I got it from there).

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

if you do a video about weird maximum flow/min cut applications it would be really awesome !

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I'm really sorry but flows aren't my strong suit. I won't do any flow videos in the near future. At least till I get better at it. I've never really solved any flow problem before :D .

    → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Nice one , but I think it would be better if you add some problems about this algorithm.

→ Reply
»
18 months ago, # |
  Vote: I like it +9 Vote: I do not like it

I deleted my old email back in 2017 or 2018 the video appears to be deleted with it :/

→ Reply