t временный

1. KT: T-H-A

2. But I assumed that T was already the smallest

3. BV & KT: (both fingerspell) K-A-T-E-L-Y-N

4. So the whole graph T is much bigger, right?

5. So I look at the graph T. I Know T is connected.

6. KT: K-E-T-E-L-Y-N

7. KT: (FS) T-H-A-N-K-Y-O-U

8. KT: how sign T-H-A-N-K-S?

9. KT: T

10. BV: hey, hey how you sign (fingerspells)T-H-A-N-K-S, (FS) T-H-A-N-K-S

11. BV/KT: (FS) T-H-A-N-K Y-O-U

12. So we constructed T as the subgraph that

13. So what is T star?

14. a tree, and T is not a tree.

15. I will get back the original T over here.

16. BV/KT: (FS) T- H-A-N-K-S

17. subgraph T, essentially, with a smaller number of edges.

18. KT: (FS) T-H-A-N-K-S

19. So therefor, T must have a cycle.

20. the graph T minus this edge e is still connected.

21. two means. And I finished the video with examples of doing a t-sample mean t-test and a 2 sample

22. "s", "t", "d", "f".

23. KT: how sign T-H-A-N-K Y-O-U

24. So let T star be such a minimum spanning tree.

25. We know that T is not a spanning tree.

26. KT: K-A-T-E-L-Y-N

27. Girl: (fingerspells) K-A-T-E-L-Y-N

28. We know that this particular T over here

29. T star could be, for example, the spanning tree

30. after removing e from T.