Graph Explanation

graph 1

• Graph 1 shows that it has no deadlock because there is no other cycles going on.
• R1 has one instance, R2 has 2 instances, R3 has one instance and R4 has 4 instances.
• P1 is requesting an instance in R1.
• P2 is holding an instance from R1.
• P3 is holding an instnace from R3.
  

graph 2

• Graph 2 shows that it has a deadlock because there is a cycle and process 3 is requisting an instance.
• P1 is requesting an instance in R1.
• P2 is holding an instance from R1.
• P3 is holding an instance from R3.
• P3 is requesting an instance in R2.

graph 3

• Graph 3 shows that there is no deadlock even it has a cycles.
• P1 is requesting an instance in R1.
• P2 is holding an instance from R1.
• P3 is holding an instance from R1.
• P3 is requesting an instance in R2.
• P4 is holding an instance from R2.
• P1 is holding an instance in R2.

graph 4

• Graph 4 shows that:
• P1 is hodling an instance from R1.
• P2 is requesting an instance in R1.
• P1 and P2 may access in or request in R2.

graph 5

• Graph 5 shows that:
• P1 is holding an instance from R1.
• P2 is requesting an instance in R1.
• P1 may access or request an instance in R2.
• P2 is holding an instance from R2.