Deadlock and cycle in a resource allocation graph
I did some thinking and then searching and all RAG conditions of this example leads to conclusion that there is no deadlock (altho there is a cycle here).

Beside after searching I found this where you can find this:



Which clearly stands Graph With A Cycle But No Deadlock

Are you sure that you have your graph correct here?