Directed vs Undirected Graphs
← Back to Graph Structures
Graphs differ by whether edges have direction. This distinction fundamentally affects which algorithms apply and what problems can be modeled.
Key Properties
Related
- Graph Representations
- Special Graphs
- Algorithms (topological sort requires DAG)