eyasir2047's blog

Shortest Path
By eyasir2047, history, 3 years ago, In English

I have just completed Dijkstra, Bellman-Ford & Floyd Warshall algorithm. Can anyone suggest to me some good essential problems?

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

Comments Comments (5)
| Write comment?
»
3 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

https://cses.fi/problemset/

Section: Graph Algorithms

Problems: for example Shortest Paths, Shortest Paths II, Flight Discount

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

    What did you do when you saw that you were stuck in a particular rating and didn't see any improvements?

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

      Nothing special — I just tried to solve harder and harder problems on my own and kept participating in contests.

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

20C - Dijkstra?, acm, cf

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

Run away from graphs, they are disgusting, if I quit CP anytime soon, it's because I'm only practicing graphs this week.

→ Reply