Definition
A directed graph is a Graph where edges have a direction. In particular, the edge pairs are now ordered.
graph LR A((A)) --> B((B))
A directed graph is a Graph where edges have a direction. In particular, the edge pairs are now ordered.
graph LR A((A)) --> B((B))