Back

Directed Graph

Idealogic’s Glossary

Directed graph is a graph which consists of vertices joined by edges in which the direction of the edge is important. These directed edges can be depicted by arrows in those cases where one vertex leads to another, and they are employed in the analysis of mathematical and algorithmic situations in the field of software development and testing.

In directed graphs, paths are sequences of edges from one node to another, trails on the other hand are paths with no repeating edges. Cycles are formed where a path begin and end at one node. As with any set of concepts, directed graphs can be quite arcane and difficult to understand for people who are not familiar with the field.