bro i love you man. all the questions that was poping in my mind you have answered them. I have searched so long for them but I couldn't find them except here. Thanks again!
2:45 is confusing if you take example a->b graph. A graph with one edge. There is no cycle , but there exist path which visits all the edges at least once.
From the table, it says that we need to have - one vertex where degree out - degree in = 1 AND - one vertex where degree in - degree out = 1 AND - all other vertices must have equal degree in and degree out. But the example from 8:08 says that it has Eulerian path because all in/out degrees are equal. From the table, I thought you were saying that we need to satisfy ALL of the conditions, not just one of them. Could you please clarify Eulerian Path for directed graph requirement(s)?
@@sameerchoudhary8590 I guess that statement is also true for directed, not just undirected graph? I know that statement came out on 7:06 for undirected graph but wasn't clear if that was true also for directed graph. And I missed out on the "at most". Thanks for pointing that out.
3:12 Can an Eulerian Path in an Undirected graph have just even degrees? Take the simple triangle graph. All the vertices have 2 edges. But using them all makes a cycle. You can't make a path without one of the edges being unused.
This is awesome. I have a question apart from this topic. What are some important problems and topics that cover the Computational Geometry part? can you please provide the topics and resources?
Computational geometry is a fun topic. Important things to cover there IMO would include basic shape intersections, convex hulls, ray tracing, line sweeping techniques, and perhaps geometric data structures like quadtrees and K-D trees.
Where to study about the intersection or common area of intersection of N shapes arranged in random way in 2D planes? Ex : Common area of intersection of N overllapping rectangles.
Spoted some mistakes (i think) In 857 there is no path Non directed graphs are a spciel case of directed graph which feets ur requirment for eulrian path but they dont all have a path soooo explain
I love your way to explain Eulerian Path and Circuits that you gave a lot of good examples.
bro i love you man. all the questions that was poping in my mind you have answered them. I have searched so long for them but I couldn't find them except here. Thanks again!
Best explaination, great video and consice animation . Indeed Graph is your favourite topic!!!
Thank you for the video :)
Your videos are awesome..Please make videos on Maximum flow in graph.
Awesome explanation and the table is great!
Super helpful video. Thanks!
I love your explanation, bravo!
Awesome 💙
Really nice explaination
Awesome examples!
Good video, thank you.
a self-edge counts for 1 indegree and 1 out-degree
MAKE MORE VIDEOS CAUSE THEY ARE AWESOME
Great explanation!!!
Awesome video !!!
Plz reply to this ques that for a directed graph,we can find euler circuit or path in case of disconnected graph but not in undirected graph,why?
2:45 is confusing if you take example a->b graph. A graph with one edge. There is no cycle , but there exist path which visits all the edges at least once.
nice music bro
From the table, it says that we need to have
- one vertex where degree out - degree in = 1 AND
- one vertex where degree in - degree out = 1 AND
- all other vertices must have equal degree in and degree out.
But the example from 8:08 says that it has Eulerian path because all in/out degrees are equal.
From the table, I thought you were saying that we need to satisfy ALL of the conditions, not just one of them.
Could you please clarify Eulerian Path for directed graph requirement(s)?
If a graph has Eulerian circuit then it also has Eulerian path.
In the table, it says at most not exactly.
@@sameerchoudhary8590 I guess that statement is also true for directed, not just undirected graph? I know that statement came out on 7:06 for undirected graph but wasn't clear if that was true also for directed graph.
And I missed out on the "at most". Thanks for pointing that out.
3:12 Can an Eulerian Path in an Undirected graph have just even degrees?
Take the simple triangle graph. All the vertices have 2 edges.
But using them all makes a cycle. You can't make a path without one of the edges being unused.
6.39 Is there are 4 verticies having 3 degree how it has eulerian path
actually two of them have 4 degrees. i also saw that by mistake at first....
@@idealspeaker1377 so ahahahha? it still not an eulerian path
amazing ...
Best🙂
Thanks for this video. I'm having trouble finding the slides for this video on GitHub. Can you please share a link?
They're under the slides/graphtheory folder from the root dir
@@WilliamFiset-videos Found them! GitHub was truncating the PDF for display. Thank you!
For a undirected graph,is it essential for the graph to be connected?
Also,for directed graph,is it essential to be connected?
7:41
I love you
You should have made it more clear whether the conditions are necessary or sufficient.
This is awesome.
I have a question apart from this topic.
What are some important problems and topics that cover the Computational Geometry part?
can you please provide the topics and resources?
Computational geometry is a fun topic. Important things to cover there IMO would include basic shape intersections, convex hulls, ray tracing, line sweeping techniques, and perhaps geometric data structures like quadtrees and K-D trees.
Where to study about the intersection or common area of intersection of N shapes arranged in random way in 2D planes?
Ex : Common area of intersection of N overllapping rectangles.
I learned from programming problems and blogs, sorry I don't have any videos on the subject matter.
okay
i think an eulerian path and elerian trial are 2 different things. a trail can have repeated verices and a path can't
Spoted some mistakes (i think)
In 857 there is no path
Non directed graphs are a spciel case of directed graph which feets ur requirment for eulrian path but they dont all have a path soooo explain
It doesn't matter if we don't visit all the vertices, we should just visit all edges once.
@@shoebmoin10 ok gotya
Seems to be talking about non-existence
6:37 this isnt an eulerian path ahahah