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
Martin, this looks 99% correct! In both cases, you’ve produced a spanning tree using a breadth-first algorithm. However, in your very last step for #15, it looks like you forgot that the vertices are ordered alphabetically. Since q comes before r, you’ll want to include the edge (q,s) instead of the edge (r,s). Otherwise, looks great!