Connected Directed Graph

A Connected Directed Graph is a directed graph that is a connected graph.

• Context:
  • It can range from being a Fully-Connected Directed Graph to being a Partially-Connected Directed Graph.
  • …
• Example(s):
  • a Strongly Connected Graph Component.
  • …
• Counter-Example(s):
  • an Unconnected Directed Graph.
  • a Connected Undirected Graph,
• See: Lattice Graph.

---

---