This blog discusses a CS problem where a faulty robot explores a graph with forced and non-forced moves. The robot can make a random move at most once. The task is to find all nodes where the robot could stop permanently. The solution involves DFS and tracking if a non-forced move has been made.
As part of a CS course, Alice just finished programming her robot to explore a graph having nn nodes, labeled 1,2,…,n1,2,…,n, and mm directed edges. Initially the robot starts at node 11.
While nodes may have several outgoing edges, Alice programmed the robot so that any node may have a forced move to a specific one of its neighbors. For example, it may be that node 55 has outgoing edges to neighbors 11, 44, and 66 but that Alice programs the robot so that if it leaves 55 it must go to neighbor 44.
If operating correctly, the robot will always follow forced moves away from a node, and if reaching a node that does not have a forced move, the robot stops. Unfortunately, the robot is a bit buggy, and it might violate those rules and move to a randomly chosen neighbor of a node (whether or not there had been a designated forced move from that node). However, such a bug will occur at most once (and might never happen).
Alice is having trouble deb
最低0.47元/天 解锁文章
373
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
