You are playing a game with rooms and tunnels. Each tunnel goes from room to room and changes your score by (which can be negative). You start in room and want to reach room . What is the maximum score you can get?
This looks like longest path on a DAG, but the graph might have cycles. If there is a positive cycle reachable from room that can reach room , you can loop forever and get infinite score.