[prev] 21 [next]

Graph Terminology (cont)

Undirected graph
  • edge(u,v) = edge(v,u),   no self-loops   (i.e. no edge(v,v))
Directed graph
  • edge(u,v) ≠ edge(v,u),   can have self-loops   (i.e. edge(v,v))
Examples:

[Diagram:Pic/ud-graphs.png]