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 - Дополни граф (precisely the type I want) 449B - Jzzhu и города (really easy, but still a Dijkstra with modif) 59E - Кратчайший путь 2nd Shortest Path Problem

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