In graph theory, entanglement of a directed graph is a number measuring how strongly the cycles of the graph are intertwined. It is defined in terms of a mathematical game in which n cops try to capture a robber, who escapes along the edges of the graph. Similar to other graph measures, such as cycle rank, some algorithmic problems, e.g. parity game, can be efficiently solved on graphs of bounded entanglement.