A directed acyclic graph (often abbreviated as "DAG") is a directed graph that does
not contain any cycles. An example of a DAG is shown in the figure below.
Report a typo
Page:
Context:
Flag as inappropriate
Are you sure you want to flag this comment as inappropriate?
Welcome to Rosalind!
Rosalind is a platform for learning bioinformatics through problem solving.
Please login with Google/Twitter/Facebook or
register a new account.
