Lec-28 Chinese Postman Problem

[@puneetkumarsingh1484]

This is the most clear explanation and well explained solution I found on internet.

[@gideonivanpanjaitan2560]

yeah, indeed

[@SHASHANKRUSTAGII]

yep

[@vinirlima]

Hello, I am from Brazil, and your classes really helps me to understand the problem! Thank you.

[@aryadas7786]

Brazil will win Fifa wc 22 😊

[@GinFeaturingTonic]

thank you prof, you really explain those problems really good!

[@divyankgupta8752]

Best Lecture on this topic, thank you very much !!

[@debiprasannapati]

excellent lecture..thanks for releasing lectures

[@rqi522-g6x]

Excellent presentation

[@uditsethia7]

Excellent Video

[@shridharvelhal]

Is this problem needs to satisfy the triangle inequality ?

[@Dani_H]

Which is the name of the second algorithm? Thanks

[@luigmoec]

Thanks for the lesson! Excelente!

[@rob101193]

Good video but 115+215=330 not 340

[@kalaivanivajiravel9268]

Thank you Sir

[@IncidentalChopstics]

Wouldn't a graph be Eulerian if it had at most 2 vertices of odd degree?

[@notknown42]

Yes, would be a eulerian

[@r5t6ymax]

@@notknown42 Actually no. To say a graph is Eulerian is to say the graph has an Euler tour. An euler tour exists only if every vertex has even degree. If the graph has 2 vertices of odd degree, then there exists an euler trail (open euler tour), but not an euler tour. Hope this helps.

[@aaaaaaaaaaaaaaaaaaaaaaa4399]

Semi Eulerian

[@ShafaetAshraf]

Thanks,good video

[@Abhik262]

was a bit slow and at 21:30 (stopped watching then) im sure it should say 330 not 340 but thanks anyway.

[@agnostic2003]

Woww😍

[@KingHenProductions]

hahahahahahahahahaha please come again