In this post we are going to talk about Directed Acyclic Graphs Examples and Topological order in a graph.
Directed Acyclic Graphs?
Def. A Directed Acyclic Graph is is a directed Graph which contain no directed cycles
Lemma. If a graph is Directed Acyclic then G has a node with no entering edges.
Topological Order Def. A topological order of a directed graph is G = (V,E) is an ordering of its nodes as V1 to Vn so that for every edge (Vi, Vj) we have i < j.
Lemma. If a graph G is Directed Acyclic then it has Topological Ordering.
Read full post on https://hecodesit.com/directed-acyclic-graphs-examples/
Top comments (0)