題組內容

3. Find and draw all the spanning trees of the following graphs. You have to list all the spanning trees to get full points for each subproblem. Otherwise, you get 0 points.62062f76a0807.jpg

3.1 K3 (i.e., a complete graph with 3 vertices). (5 points)