DAG

In algorithms a directed acyclic graph is more commonly known as a dag. It's use to find paths to different locations. They usually form one of several topographical orderings.