Directed Acyclic Graph

Posted By on October 27, 2014


Download PDF
Principle of Optimality
Difference between Divide & conquer and Dynamic programming

A directed, acyclic graph is a directed graph that contains no cycles.

Obviously, all trees are DAGs. However, not all DAGs are trees. For example consider the two directed, acyclic graphs, tex2html_wrap_inline71573 and tex2html_wrap_inline71575, shown in Figure gif. Clearly tex2html_wrap_inline71573 is a tree but tex2html_wrap_inline71575 is not

figure48874
Figure: Two Directed, Acyclic Graphs

Principle of Optimality
Difference between Divide & conquer and Dynamic programming

Download PDF

Posted by Akash Kurup

Founder and C.E.O, World4Engineers Educationist and Entrepreneur by passion. Orator and blogger by hobby

Website: http://world4engineers.com