tehqin's blog

Algorithms Live! Episode 1
By tehqin, history, 8 years ago, In English

In honor of Donald Knuth's lecture series on trees, this week's episode of Algorithms Live! will cover trees. More information can be found here: http://algorithms-live.blogspot.com/2016/12/episode-1-trees-and-diameters.html

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

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

Humble request: Please do Episode 2 on Centroid Decomposition.

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

    Episode 2 will feature our first guest and is being planned. I will cover centroid decomposition in the future though. :) I will cover finding centroids this week and many of the prerequisites for centroid decomposition.

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

      How to find remoteness of all nodes of a tree in one DFS ?

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

        Yes. You can modify your DFS to also keep track of the longest path coming in through the parent. Then you just have one extra path to stitch to a subtree path.

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

great work

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

Great work! A very good initiative. Keep it up...

→ Reply