Directed Graph

🔥 Directed Acyclic Graph → A DAG is a directed graph with the additional constraint of no cycles; it extends the directed_graph structure by imposing acyclicity, enabling topological ordering and dependency analysis.

🔥 Markov Chain → A Markov chain models states as nodes and admissible next moves as directed edges; it extends a digraph by assigning probabilities to outgoing edges (forming a row-stochastic transition matrix from the digraph’s adjacency). The digraph structure is required before adding stochastic behavior.

Graph Traversal →

Finite State Machine →

Topological Sort →

Edmonds-Chu-Liu Algorithm →