What is a resource-allocation graph?
Deadlocks can be described more precisely in terms of a directed graph known as a system resource allocation graph. This graph having of a set of vertices V and a set of edges E. The set of vertices V is partitioned into two dissimilar types of nodes; P the set having of all active processes in the system and R the set having of all resource types in the system.