This is a simple example of a typical pursuit evasion problem where a bunch of pursuers strategise to nab the evaders. Before the pursuers proceed on nab the evaders, it is important for them to startegise the search to save time and manpower.
Given a bounded, connected, undirected graph, is it possible for a cop to devise a startegy such that he is always successful in nabbing the robber (irrespective of the strategy choosen by the robber) in finite number of steps. Likewise, is it possible for the robber to devise a strategy to stay away from the cop, forever?
A CLI application built in JAVA that determines if a graph is cop-win or robber-win
- Input the number of vertices (V) and number of edges (E) in the graph.
- Then input each edge (a pair of 2 vertices) one by one. Note: Vertices are to be labelled as integers from (0 to V-1)
- Graph is cop-win or robber!
- List all the pitfalls in the graph.