Can Someone Explain In Simple Terms To Me What A Directed Acyclic Graph Is?
Answer : graph = structure consisting of nodes, that are connected to each other with edges directed = the connections between the nodes (edges) have a direction: A -> B is not the same as B -> A acyclic = "non-circular" = moving from node to node by following the edges, you will never encounter the same node for the second time. A good example of a directed acyclic graph is a tree. Note, however, that not all directed acyclic graphs are trees. dots with lines pointing to other dots I see lot of answers indicating the meaning of DAG (Directed Acyclic Graph) but no answers on its applications. Here is a very simple one - Pre-requisite graph - During an engineering course every student faces a task of choosing subjects that follows requirements such as pre-requisites. Now its clear that you cannot take a class on Artificial Intelligence[B] without a pre requisite course on Algorithms[A]. Hence B depends on A or in better terms A has an edge directed to B. So...