15-251. Great Theoretical Ideas in Computer Science. Upcoming Events. Quiz this Thursday. Test in 2 weeks. Graphs II. Lecture 21 (November 6, 2007). Recap. Theorem: Let G be a graph with n nodes and e edges. The following are equivalent:. 1. G is a tree (connected, acyclic).

15-251

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -