Блог пользователя Please_Read

Graphs
Автор Please_Read, история, 3 года назад, По-английски

recently i am seeing lots of graphs problem in div 2 C & D. so i am planning to solve graph problems in range of rating 1500-1800. which graph algorithms i need to learn to solve this rated range problems?

  • Проголосовать: нравится
  • -31
  • Проголосовать: не нравится

»
3 года назад, # |
  Проголосовать: нравится +8 Проголосовать: не нравится

First of all, bfs and dfs. It would be enough for the majority of the problems, especially if you can implement dp over subtrees with dfs.

Probably some shortest path searching algorithms (like Dijkstra, Ford-Bellman and Floyd-Warshall) are also required, but they aren't that important.

→ Ответить
  • »
    »
    3 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    should i learn dp before coming to graphs? i completed number theory, bs, recursion & stl, now i wanted to learn graph.

    → Ответить
    • »
      »
      »
      3 года назад, # ^ |
        Проголосовать: нравится +8 Проголосовать: не нравится

      Well, dp over subtrees is usually quite intuitive. It is also somehow different from other types of dp, so I think, you shouldn't.

      If you understand how to calculate the sizes of all subtrees in some tree using dfs, you probably understand the whole thing.

      → Ответить