A loop is an edge that connects a node $v$ of a graph to itself, written $\{v, v\}$. Loops may also represent directed loops $(v, v)$. In the figure below, an (undirected) loop is shown connecting node 1 to itself.