English subtitles

← 15-02 Dave's Problem

Get Embed Code
1 Language

Showing Revision 1 created 10/03/2012 by Amara Bot.

  1. And actually, just this one here is correct.
  2. The other 2 are not correct,
  3. and as I told you, the conditions for a spanning tree are
  4. first, it can contain no cycles.
  5. and actually here, we have a cycle,
  6. so this can not be a spanning tree.
  7. And over here,
  8. we said that a spanning tree must still keep the whole graph connected,
  9. so all vertices connected to each other,
  10. and this is not the case here,
  11. so here, we have basically split the graph into 2 parts.
  12. Here is 1 part and here is the other part.
  13. So this is also not a spanning tree.