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 🙂
Header Image
Creative Commons image courtesy of Flickr user StormPetrel1-
Recent Posts
Recent Comments
- In the Spotlight: MAT2540 – Discrete Structures and Algorithms II – The Open Road on Links
- OpenLab Workshop for Opening Gateways Fellows | 2018-2019 Opening Gateways Faculty Seminar on Final Exam Review
- Eric on Eric’s Final Review
- Kate Poirier on Hints/reminders from today’s class
- Kate Poirier on Final Exam Review
Archives
Categories
Meta
https://openlab.citytech.cuny.edu/poiriermat2540spring2016/2016/04/01/jose_betance_test_review_2_11-4_15_/