# Directed graph

Jump to navigation
Jump to search

A **directed graph** is a graph consisting of only directed edges. Directed edges are edges that have a direction, thus if node *a* has a directed edge to node *b*, it does not imply that we can reach node *a* from node *b*.