Problems that are Dijkstra with a Twist

Правка en3, от minimario, 2016-11-02 23:13:33

Hi guys!

Does anyone have some problems that are modifications of Dijkstra's algorithm? I feel that the scope of Dijkstra problems I can solve is pretty small. Here are the types of problems I am referring to... (these are kinda easy)

  1. 715B - Complete The Graph (precisely the type I want)
  2. 449B - Jzzhu and Cities (really easy, but still a Dijkstra with modif)
  3. 59E - Shortest Path
  4. 2nd Shortest Path Problem (Find the 2nd shortest path from A to B)

Please, if somebody can provide some more (more difficult) Dijkstra problems, that would be really helpful!

Теги dijkstra, its_not_so_easy, problems

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский minimario 2016-11-02 23:13:33 15 Tiny change: 'odif)\n1. [problem:59E] \n1. 2nd S' -> 'odif)\n1. [problem:59E]\n1. 2nd S'
en2 Английский minimario 2016-11-02 23:12:27 48
en1 Английский minimario 2016-11-02 23:09:58 540 Initial revision (published)