Identifying Isomorphic Trees | Source Code | Graph Theory

preview_player
Показать описание
Source code for identifying isomorphic trees

Related videos:

Source code repository:

Video slides:

===================================

Рекомендации по теме
Комментарии
Автор

Feels really nice when you are able to code this all on your own. Thanks a lot man. Your lectures are a blessing.

mayankpant
Автор

I am definitely going to have to watch this more than 8-12 times.

curtism
Автор

Thanks for the effort you put in these :)

Doomguards
Автор

awesome, could anyone tell how to implement the lexicographic sorting in c++

mersenne
Автор

What would be the time complexity for the encode function?
I think it should be O(v + e) + O(v * k * clogc), where v = num nodes, e = num edges, c = number of children & k = length of subtree encoding.
For every node in the tree, we are sorting labels array which consists of node.children.size() (c) strings each of length let's say k (multiple of 2) so it would take (k * clogc) in sorting encodings of subtrees and for every v vertex in the tree time would be O(v * k*clogc).
Is this analysis correct? If yes how to express k and c in terms of v and e.

tusharrawat
Автор

This is awesome. I learned a lot from you.

kevintran
Автор

It would have been good if you could explain what is the structure of the trees, and how your representing them.
How is the tree represented as List<List<>> ?

rushilp
Автор

What if the first tree has two children?

rashigupta