A Wait-for graph is a type of directed graph used in computer science, particularly in the context of database management systems and concurrent programming, to represent the wait-for relationships between transactions or processes. It is primarily used to detect deadlocks. In a Wait-for graph: - Each node represents a transaction or process. - A directed edge from node A to node B indicates that transaction A is waiting for a resource that is currently held by transaction B.
New to topics? Read the docs here!