Видеословарь
Искать видео по слову
Все слова
Войти
V
Искать
X
V
глагол
Предыдущее
Следующее
показать все...
1.
v
2. It goes all the way up to vk, which is the last vertex,
v
.
3. if there is a path from u to
v
.
4. to
v
. Then we know by the ordering principle
5. That's confusing-- from u to
v
. Then there
6. We actually defined two vertices, u and
v
7. also exists a path from u to
v
.
8. So let
v
be a leaf of the tree.
9. connects u to
v
. So u and
v
are connected
10. And then we go all the way up to vk which is equal to
v
.
11. So we reattach
v
. And if I do this,
12. So we reattach
v
. And if I do this,
13. We actually defined two vertices, u and
v
14. T that has the vertex set
V
and an edge set E.
15. Well, we have deleted
v
. So we have to reattach
v
again.
показать все...