Edge Classification in Undirected Graphs

Edges in graphs are much simpler to classify than edges in digraphs. Primarily because, unlike an edge in a digraph, each edge $(u,v)$ of a graph can be explored in either direction, from $u$ to $v$, or from $v$ to $u$.

Each edge of a graph is ...