 The possibility of a deadlock is implied by graph cycles in the conjunctive case, and by knots in the disjunctive case.There is no simple algorithm for detecting the possibility of deadlock in the final case.