Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
-
Updated
Jul 2, 2020 - Prolog
Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
Add a description, image, and links to the banker-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the banker-algorithm topic, visit your repo's landing page and select "manage topics."