# Directed graph A directed graph, or digraph, is a graph whose edges have a direction: each edge runs from one vertex to another rather than simply connecting the two symmetrically. Directed graphs are the natural way to model asymmetric relations — precedence, flow, causation — where the relationship does not run the same way in both directions. ## Microsim — queued <p class="wt-pending"><strong>Microsim/diagram layer in the draft queue.</strong> Troy is building the interactive station for this concept by hand; the sourced overview below is complete and citable now.</p> ## Overview When a directed graph contains no cycle it specializes to a [[Directed_acyclic_graph|directed acyclic graph]]; when it is allowed to cycle and its edges carry a sign for reinforcing or opposing influence, it becomes a [[Causal_loop_diagram|causal loop diagram]]. The same directed-edge idea, generalized to weighted and undirected cases together, is the object of study in [[Network_theory|network theory]]. **On the spine:** [[Directed_acyclic_graph]] · [[Causal_loop_diagram]] · [[Network_theory]]. ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Directed_graph) : [Wikitube](https://en.wikitube.io/wiki/Directed_graph) ## Previous hub tags Hubs: `Systems`. Portals: [[PORTAL_Causal_loop_diagram]]. --- *Repopulated 2026-08-05 · text transfer · 0 deletions.*