- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Acyclic digraphs in Data Structure
Here we will see the what is the Acyclic digraphs. The acyclic digraphs are directed graphs containing no directed cycles. The Directed Acyclic Graphs are abbreviated as DAG.
Every finite DAG has at-least one node whose out-degree is 0.
Example of DAG with one node −
Example of DAG with two nodes −
Example of DAG with three nodes −
Advertisements
To Continue Learning Please Login
Login with Google