Graph Theory: Euler Paths and Euler Circuits

[@ChrisMCastro]

I read a whole chapter on this only to find myself lost. I watched this video and now I get it.

[@petergalione9687]

I agree. Thank you for the clear explanation.

[@professional_programming]

Me too

[@SMAbdulMueid]

9 years later still useful, tyvm.

[@bowlofrice7214]

The textbook is so convoluted that i read, but this video made it more than just simple to digest and understand

[@bevanp2889]

Your elucidation cleared every doubt of mine. Thanks a bunch for this short tutorial

[@Jennip93]

Thank you. I cant seem to learn from my teacher, she's way AdHd. This taught me in a snap!

[@chavalit94]

Thanks sir.. In 2 days im going to answer these euler and hamiltonian question thank you sir I understand more than my lecturer taught me

[@janeenriquez1944]

Very helpful 👍 especially most of the classes are modular because of pandemic. Thank you !

[@tasfiatabassum5130]

it was really helpful. Thanks a lot for giving so much of your time to help students. I really mean it. Thanks :)

[@TorresVr1]

I did find the video helpful. Thank you for the good explanation.

[@nageensaira8921]

wonderful well explained then professor's 1-hour lecture and book 2 to 3 pages explanation.

[@zooz151]

I'm really really thankful for this account .... it's help me to understand

[@heyitscfs]

Thank you, this helps so much!

[@tylerruiz3476]

Great Video, Greetings from Universidad de Guadalajara, Mexico!

[@eifet]

The theorem do help to find an Euler path, it states that the start and end vertices have to have odd degree. So you always start and end on odd degree vertices, afaik

[@jeremiahabbott5277]

So a path can start and end at any path and only use the line’s connecting them once. A circuit can start at any point but it must end at that same point without using any lines more than once.

[@madinaakbari8369]

You save my time MAN, thanks:)

[@2A9D8F]

Your voice is so calming...

[@playonce4186]

think ur just tired

[@PlasticWind]

this is best as simplest explanation! thank you!

[@Mathispower4u]

Thank you for your comment!

[@devendra.sanghavi]

You Sir, are Great !

[@KisanKumar-ug1cf]

I understand about how to find an Euler path. Thank you.

[@shoaibghyasi3246]

thank you very much iit really helped me tomorrow i have exam but hopefully i learned it

[@kgu_gamage]

Thank you so much! This video was really helpful.

[@vishwanageshwar1688]

Sir you were awesome explaining in this lecture video

[@Sam4]

Great explanation!

[@zaramalik5457]

Life saver. Thank you sir God bless you 🙏☺️

[@arunsharma-tc6jv]

god bless u
very helpfull job

[@NZIGNANTI]

@6:00 is the best definition ever for NO EULER PATH.

[@HabiburRahman-xs9gb]

thanx a lot sir...u deserve more than thank

[@mercellachristie07]

Thank you Sir.💯🙏🏻

[@aseelzubaidi]

so helpfullll,love youuu a life saver istg

[@imbocjhonnamaries.3481]

this is really helpful, you explained it well thankyou so much

[@moon5497]

Thank you very helpful video

[@mimisgarden260]

thanks a lot!!! it is very helpful for my exam

[@johndavesbaguio7044]

Helped me a lot, thanks

[@d.k.2199]

But in path Travers we can't repeat vertex so, I have a dought that why are you repeat ing vertex in eular graph plzzzzz ans me ..........

[@vikramtete7461]

Yeah...I am also having the same doubt... As far as I know in path edges are repeated but not the vertices

[@hayyzum]

This is very helpful. Thank you!

[@astellayippy7693]

Yes . very helpful. Thank you for sharing !

[@blacklotus5953]

Great explanation, thank you.

[@saibhargav8886]

Thanks for giving a beautiful lecture about this topic
It helped a lot to get good marks in my exam
thanks a lot _/\_

[@shereenkhan6640]

Yes, it was indeed helpful

[@LuisDenton]

Awesome video!

[@October17D]

Great video! Thanks

[@mohammadshahoud218]

thanks .. I found this very helpful :)

[@prabhavanniar37]

Thanks a Lot. It was helpful.

[@ninalaniroseabkilan4064]

Thank you very much

[@berkaybingol6792]

It was indeed helpful. Thanks !

[@datnguyenhotan9149]

Niceeee Explanation, Danke!!

[@ivancampos6754]

This was helpful, thanks.

[@saminyasar7332]

It was helpful. Thanks.

[@PrathimaPrathima-c3q]

Thanks a lot sir🎉

[@Mathispower4u]

Most welcome

[@fatimahabib1431]

great explanation thanks a lot

[@buscapee]

in your examples for the euler path, the vertexes are repeating. by definition, they cannot repeat themselves if they are a path

[@torezgermy2]

I think the edge is what shouldn't repeat not the vertex.

[@keldonchase4492]

I have in my notes that neither edges nor vertices can repeat in a path so yeah I’m really confused.

[@krishnendusubash990]

Thanks 🙏🏼

[@PNADA123]

Thank you for explaining these concepts

[@VidyalokFoundation]

very nice

[@techsupport541]

Nice work...

[@JeremiahSwashbuckler]

I"m Confused in the very first example it started at C then to B and Then to A but then went from A back to C before going from C to D. If an Euler Path has no repeats wouldnt starting from C and then going from A back to C repeating C?

[@Mathispower4u]

Vertices are be revisited, but edges can only be used one time.

[@hananwasul83]

Thank you soooo much 💛

[@孙浩林-y9y]

What a nice video!

[@ElifArslan-l9g]

thank you

[@TBC5414]

Good expalanation

[@Mathispower4u]

Thank you!

[@nozzerjuice]

Thank you sensie

[@naveenkmahendra5108]

Good one!

[@Joey_Decker]

For the Euler Circuit, how does going from E to B twice not count as a repeat?

[@Mathispower4u]

Because we only care about each edge being used once, not vertices.

[@phbyhw218]

are there any way to know how many euler paths are there in a graph?

[@viraltiktokcompilations58]

Damnn.. Thank you so much man❤

[@onlinesurvays6722]

but in second eg path visiting A twice how could it satisfy. eulars path

[@brasilianloser]

hmmm Euler Path must have no odd vertices or exactly two... stopping at one and saying its not possible is wrong unless I am missing something here.

[@sharezhussain4284]

good one dude

[@mizopa9150]

good job man

[@estherk7820]

did u made any videos on colored n planar graph

[@yash9shhreya]

Is it possible two have euler circuit without being euler path ?
Kn complete graph n greater than 4

[@peterburbery2341]

Can you do more videos on graph theory?

[@altomusinspr3183]

Thank yeah

[@ishaqs-k5j]

best video

[@Mathispower4u]

Thank you!

[@stanezzz]

Thanks.

[@itsforme1948]

Tnx tomorrow is my xm

[@drecinema]

I still don’t get it after watching this

[@MikeDiaz-mf4jz]

Same

[@shahongezahegne4847]

That's a you problem

[@PavanUthsara]

Wow❤️

[@maimounatraore6982]

THANK YOU SOOOOO MUCHHHHHH

[@DarkGT]

Are you ready to change after watching the video?

[@hassanhashemi6478]

thanks man

[@estherk7820]

awesome

[@sniyamonaharan4735]

👍

[@pim7149]

The small ones are what's easy. The crazy looking euler circuits are what screw me up

[@sreejusivaraman1370]

It is not possible it is same as the utility problem

[@SkooD963]

who's here in 2020

[@torezgermy2]

I'm here in 2021 lol

[@kthree100]

im not trying to be racist...but indians ar not good at teaching international students. #mathispower4u you make my work a 1000x easier!!

[@sacpanediejanet.8586]

MATH IN THE MODERN WORLD SUCKS

[@jamesbouk]

reply if u dtf 😍

[@ThemBkba]

bitch im here to math

[@marry-anntan9071]

thank you

[@nhridoy2195]

Thank you

[@Luxv_mo]

Thank you