A cycle in a resource-allocation graph is a necessary and sufficient condition of existence of deadlock. That mean, if a resource-allocation graph contains a cycle, there must exist a deadlock.
A.True
B.False