Search

1 of 8 0-day streak

Trees and spanning trees

DIFFICULTYintro
Question 1 of 8

Calculator allowed

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

1 mark

Select the graph that is connected and has no cycle, loop or parallel edge