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 (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!