- Digraph without any cycles.
- More general than trees
- See Figure 7.12 for some examples
- Useful in many applications, such as
- 1.
- Representing syntactic structure of arithmetic expressions
- 2.
- Representing task graphs
- 3.
- Precedence relations in many scheduling applications

eEL,CSA_Dept,IISc,Bangalore