Used for deadlock avoidance when there is  only one instance of each resource type. Claim edge: Pi Rj indicates that process Pi may request  a dashed line. Claim edge converts to request edge when a process  requests a resource. When a resource is released by a process, assignment  edge reconverts to edge. Resources must be claimed a priori in the system.  If request assignment does not result in the formation of  a cycle in the resource allocation graph - safe state, else resource unsafe state. Rj; by 25 Claim Graph
 Used for deadlock avoidance when there is only one instance of each resource type.  Claim edge: Pi Rj indicates that process Pi may request  resource Rj; by a dashed line.  Claim edge converts to request edge when a process requests a resource.  When a resource is released by a process, assignment edge reconverts to edge.  Resources must be claimed a priori in the system. If request assignment does not result in the formation of a cycle in the resource allocation graph - safe state, else unsafe state. 25 Claim Graph