Undirected Graphs
lAn undirected graph
is a way of presenting a symmetric binary
relation:
Since whenever x is related to y also y is related to x, we donŐt have to show direction with arcs. Instead of calling them arcs then, it is common to call them edges.
Since whenever x is related to y also y is related to x, we donŐt have to show direction with arcs. Instead of calling them arcs then, it is common to call them edges.
A
B
C
Symmetric,
directed:
A
B
C
undirected: