This video is part of an online course, Intro to Algorithms. Check out the course here: www.udacity.co....
Пікірлер: 40
@JoonasNakiVaivaa8 жыл бұрын
Damn what a cliffhanger
@Hasblock Жыл бұрын
I'm still hanging 7 years later
@sonictitan4335 ай бұрын
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
@larsaugustat70295 ай бұрын
you are better now?@@Hasblock
@cranberry_sam4 жыл бұрын
Wasting 3 minutes on a mediocre video only to not get the entire lecture, REALLY makes me wanna sign up for udacity!
@mariomatos21304 жыл бұрын
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.2 жыл бұрын
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 :)
@root6b612 ай бұрын
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
@het3144 жыл бұрын
WTF? What's the answer ?
@rossocorsa65774 жыл бұрын
the answer is yes
@comedyvidz17853 жыл бұрын
Good. A clear and concise explanation.
@aviroxi2 жыл бұрын
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-Air2 жыл бұрын
why not just say the answer to the last question ?
@user-hl1jt9qu8w2 ай бұрын
thanks
@steveneumeyer6812 жыл бұрын
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.
@rj11wacat7 жыл бұрын
Path = no repeated vertices. Trail = no repeated edges.
@anandkrishvvenkat56447 жыл бұрын
George Foley i think ..Repeated vertices is not a problem ...
@arnabdas71456 жыл бұрын
Anand krishv venkat no in Euler's path visit vertex exactly once
@dennissantiago45242 жыл бұрын
Path and trail is the same thing😐
@dennissantiago45242 жыл бұрын
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
@davidbeauvais11838 жыл бұрын
Not sure what he means by the degree.
@mark-65728 жыл бұрын
+David Beauvais the number of edges connected to each vertex(or node)
@basementhermit36079 жыл бұрын
Too many cuts/transitions of the hand - gets rather annoying/distracting.
@claudiamendoza90932 жыл бұрын
what if you start with vertex B
@Devilfairy17 жыл бұрын
Its Eulerian trail not path.
@naemfield7 жыл бұрын
You're confusing it with Hamiltonian.
@naixinzong54496 жыл бұрын
what if i say it is Eulerian tour
@govinggoriani77656 жыл бұрын
Vanilla Ice cream, anyone?
@bellesapum94275 жыл бұрын
Devilfairy1 they’re the same thing
@kshtof Жыл бұрын
@@bellesapum9427 Yup, the terms are used interchangeably