The correspondence between undirected and directed edges is not exact. For example, in the Königsberg bridges problem, each undirected edge can be traversed only once. This constraint is easily handled with undirected edges, but directed edges require extra bookkeeping to make sure only one edge of the pair is traversed.
This page last modified on 24 January 2006.