Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
Nada-Nasser/Safe-state-algorithm
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
| Name | Name | Last commit date | ||
|---|---|---|---|---|