Algorithms For Dummies

• 

Meets a specific condition: The spot on the car is gone.

• 

Performs a specific number of times: This is the number of repetitions you 

 perform during the exercise.

---

CHAPTER 9

  Reconnecting the Dots 

     181

The following sections review Directed Acyclic Graphs (DAGs),  which  are  finite 

directed graphs that don’t have any loops in them. In other words, you start from 

a particular location and follow a specific route to an ending location without ever 

going back to the starting location. When using topological sorting, a DAG always 

directs earlier vertexes to later vertexes. This kind of graph has all sorts of  practical 

uses, such as schedules, with each milestone representing a particular milestone.