 One such deadlock detection algorithm makes use of a wait-for graph to track which other processes a process is currently blocking on.In a wait-for graph, processes are represented as nodes, and an edge from process formula_1 to formula_2 implies formula_2 is holding a resource that formula_1 needs and thus formula_1 is waiting for formula_2 to release its lock on that resource.If the process is waiting for more than a single resource to become available (the trivial case), multiple edges may represent a conjunctive (and) or disjunctive (or) set of different resources or a certain number of equivalent resources from a collection.