Eulerian Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: www.udacity.co....

[@JoonasNakiVaivaa]

Damn what a cliffhanger

[@Hasblock]

I'm still hanging 7 years later

[@sonictitan433]

idk why he didnt answer lol. The answer is if all vertices of a connected graph have even degree, then it has a Euler circuit

[@larsaugustat7029]

you are better now?@@Hasblock

[@cranberry_sam]

Wasting 3 minutes on a mediocre video only to not get the entire lecture, REALLY makes me wanna sign up for udacity!

[@mariomatos2130]

By the way, your videos are good. People mainly comment the negative stuff. Keep it up. Although it has been 8 years, but still.

[@recursion.]

you the type of guy who says its okay to life sentenced prisoners

[@amirjutt0]

with all even degree nodes , graph will definately have eulerian path as well as eulerian circuit :)

[@root6b61]

Not true if it's not connected though.

[@kerel7682]

Yeah if graph have eulerian cycle you can be sure that it also have the path

[@het314]

WTF? What's the answer ?

[@rossocorsa6577]

the answer is yes

[@comedyvidz1785]

Good. A clear and concise explanation.

[@aviroxi]

you came here bcz you saw this video only less than 5 min and you thought that this video will explain better guess what you are right!!

[@Back-Air]

why not just say the answer to the last question ?

[@user-hl1jt9qu8w]

thanks

[@steveneumeyer681]

on the last graph with the green edges, it appears that if you remove the 'e' node and the internal edges, you will have a graph where every node has degree 2, and can transit the graph by a,c,d,b,a.

[@rj11wacat]

Path = no repeated vertices. Trail = no repeated edges.

[@anandkrishvvenkat5644]

George Foley i think ..Repeated vertices is not a problem ...

[@arnabdas7145]

Anand krishv venkat no in Euler's path visit vertex exactly once

[@dennissantiago4524]

Path and trail is the same thing😐

[@dennissantiago4524]

If you mean by trail is circuit you're right, but you're wrong jn path you can repeat vertices as shown in the video and you can also repeat vertices in both euler graph but you cant repeat edges

[@davidbeauvais1183]

Not sure what he means by the degree.

[@mark-6572]

+David Beauvais the number of edges connected to each vertex(or node)

[@basementhermit3607]

Too many cuts/transitions of the hand - gets rather annoying/distracting.

[@claudiamendoza9093]

what if you start with vertex B

[@Devilfairy1]

Its Eulerian trail not path.

[@naemfield]

You're confusing it with Hamiltonian.

[@naixinzong5449]

what if i say it is Eulerian tour

[@govinggoriani7765]

Vanilla Ice cream, anyone?

[@bellesapum9427]

Devilfairy1 they’re the same thing

[@kshtof]

@@bellesapum9427 Yup, the terms are used interchangeably

[@mariomatos2130]

Drumroll..... 🥁🥁 🥁🥁... 🥁🥁 ..... 🥁🥁..... 🥁🥁... 🥁🥁 ..... 🥁🥁..... 🥁🥁... 🥁🥁 ..... 🥁🥁.....

[@fzbartttt666]

İf path closed Yes

[@user-bl2yq1hl8j]

❤❤❤

[@rahulisgreat4911]

Damn

[@subschallenge-nh4xp]

pensil loll

[@RubioDanA]

What about connecting C & B?

[@oriagruber]

+RubioDanA If you would connect C & B then no Eulerian path \ cycle would exist.