## ABSTRACT

The directed graph is another term from graph theory. A directed graph is a set of nodes and a set of directed edges. Each directed edge originates at a source node and terminates at a target node (which may be the same as the source node). The nodes of a directed graph can have any number of edges. Directed graphs arise for applications with important topology or connectivity. For example, a directed graph is a natural representation for airline flights between airports.