Tag Archives: detecting deadlocks

Written by: Jane D, on 2012-10-29

In mathematics and computer science, a directed acyclic graph, is a directed graph with no directed cycles. DAG doesn’t really have to do with programming. It’s more about problem solving. – DAG comes in handy when detecting deadlocks as they show the dependencies amongst a set of resources and processes. Deadlocks happen when a cycle is detected. – Some programming languages describe systems of values […]