Detect resource deadlock

Detect deadlock from a resource wait-for graph. You are given a list of [holder, waiter] edges meaning the waiter thread is blocked waiting on a resource currently held by the holder thread. A deadlock exists iff this directed graph contains a cycle. Return True if any cycle exists, otherwise False. Thread identifiers are arbitrary hashable values (ints).