What are directed acyclic graphs what are their properties?
Answers
Answered by
2
hey mate.......
An acyclic graph is a graph without cycles(a cycle is a complete circuit). When following the graph from node to node, you will never visit the same node twice. This graph (the thick black line) is acyclic, as it has no cycles (complete circuits). A connected acyclic graph,
pls mark brainlist answer
An acyclic graph is a graph without cycles(a cycle is a complete circuit). When following the graph from node to node, you will never visit the same node twice. This graph (the thick black line) is acyclic, as it has no cycles (complete circuits). A connected acyclic graph,
pls mark brainlist answer
Similar questions