Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 181 Bytes

File metadata and controls

2 lines (2 loc) · 181 Bytes

Deadlock (Dining Philosophers)

Write a program that reveals and solve the deadlock (circular wait or deadly embrace) that may occur in the famous Dining Philosophers problem.