Trees and spanning trees
Consider the four candidate graphs. Each entry in an edge list represents a separate edge; repeated entries are parallel edges
Consider the four candidate graphs. Each entry in an edge list represents a separate edge; repeated entries are parallel edges