Problems that are Dijkstra with a Twist

Revision en1, by minimario, 2016-11-02 23:09:58

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) 715B - Complete The Graph (precisely the type I want) 449B - Jzzhu and Cities (really easy, but still a Dijkstra with modif) 59E - Shortest Path 2nd Shortest Path Problem

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

Tags dijkstra, its_not_so_easy, problems

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English 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 English minimario 2016-11-02 23:12:27 48
en1 English minimario 2016-11-02 23:09:58 540 Initial revision (published)