** Directed Acyclic Graph**
If connections are one-way, from *v*_{1} to *v*_{2}, we say the graph
is * directed* ; otherwise, it is * undirected*.
A directed graph is sometimes called a * digraph*.
* Directed acyclic graphs*
or * DAG* representations
such as trees are important in Computer Science.

Contents
Page-10
Prev
Next
Page+10
Index