Trees and spanning trees
Each candidate below is an undirected graph. Each entry in an edge list represents a separate edge; repeated entries are parallel edges
Each candidate below is an undirected graph. Each entry in an edge list represents a separate edge; repeated entries are parallel edges