Rivka Ligier Test #2 Review: 11.4 #15

Use the depth-first search to produce a spanning tree the given sample graph. Choose a as the root of this spanning tree and assume the vertices are ordered alphabetically.

Excuse my horrible drawing 🙂



This entry was posted in Uncategorized. Bookmark the permalink.

1 Response to Rivka Ligier Test #2 Review: 11.4 #15

Leave a Reply

Your email address will not be published. Required fields are marked *