Nada-Nasser/Safe-state-algorithm
Prolog program that determines whether a graph (represents processes and resources in operating systems) can reach a safe state (with no deadlock) or not.
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.
Prolog