Directed Graphs - Theory and Terminology
- Directed Graph: aka Digraph
- Vertices, vSize
- (Directed) Edges, eSize
- (Directed) Path
- (Directed) Cycle
- Directed Acyclic Graph (DAG)
- inDegree and outDegree of a vertex
- ΣvinDegree(v) = eSize
- ΣvoutDegree(v) = eSize
|