Euler Graph | Euler Circuit | Euler Path | Eulerian Graph | Semi Eulerian Graph | Algorithm | CODE

In this video, I have explained everything you need to know about euler graph, euler path and euler circuit.I have first explained all the concepts like Walk, Trail, Euler Circuit, Euler Path, Eulerian Graph, Semi Eulerian graph and a non Eulerian graph.I have explained the conditions for a graph to be of a certain type using intuition and simple examples.After the concepts, I have shown the algorithm for detecting the type of eulerian graph.The algorithm is just a simple 2 step process where the first step is about multi-component case.All the edges must be present in a single component.The second step counts the number of nodes with odd degree.If count of odd degree nodes are even then graph is eulerian because euler circuit will be present in graph.If count of odd degree nodes is 2 then it will be a semi eulerian graph because we will have a euler path but not euler circuit.Rest all count cases will fall in a non euler graph.At the end of the video, I have also explained the CODE. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
========================================================================
Join this channel to get access to perks:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
CODE LINK: gist.github.co...
USEFUL LINKS:-
PROOF: math.stackexch...
Kosaraju Algorithm: • Kosaraju Algorithm | S...

[@chakradharkandula6670]

Great Work! Got placed in 10+lpa company, your channel is one of the reasons behind it. Thank You!!

[@techdose4u]

Wowww... Great ❤️ congratulations 🎉 I would like to know more. Please ping me on LinkedIn :)

[@ajitsakri9888]

Great man , best of luck for your future

[@willturner3440]

Which company brother?

[@chakradharkandula6670]

@@willturner3440 amzn

[@willturner3440]

@@chakradharkandula6670 but i think it's starting package is 30 lpa

[@arnavaggarwal9925]

Each and Every video itself justifies that the channel is highly underrated. Great and clear Explanation.

[@tarungulati5171]

The channel content is the best out there .

[@just_relax3110]

Best channel for DSA ❤️

[@techdose4u]

:)

[@shubhamkhurana7545]

That's great, could not have been better

[@techdose4u]

Thanks :)

[@nishugurung2339]

This was extremely helpful, thank you!

[@awesomeamazing836]

bhai tumne bahut sahi videos banaya hai

[@techdose4u]

Thanks :)

[@ApoorvaRajBhadani]

God level explanation. If possible please make a video on Flows.......can't find any good video on this topic with C++ code

[@techdose4u]

I will cover ford-fulkerson maximal flow algo in the next week. Remind me on next weekend.

[@gandhijainamgunvantkumar6783]

Amazing explanation

[@izharkhankhattak]

Very nice lectures

[@techdose4u]

Thanks 😊

[@mordernmonk194]

great explaination ❤

[@techdose4u]

thanks

[@ajitsakri9888]

Thanks a lot sir, you explained it quite intuitive

[@techdose4u]

Welcome :)

[@sabitaojha2871]

clear and detail explanation. huge appreciation

[@techdose4u]

Thanks :)

[@prateekpandey4781]

Excellent Explanation

[@kushagrashekhawat8227]

Bro, you deserve a million subscribers but most of the people are interested in *Gyan* instead of useful knowledge.
If you could explain how to find the eulerian circuit it would be great.

[@techdose4u]

I think it's already uploaded in later video of graph playlist.

[@kushagrashekhawat8227]

​@@techdose4u I couldn't find it in the graph playlist. can you please give me the link?

[@willturner3440]

Right, Love babbar doesn't deserve 500k + subs

[@kp_nagar]

great explanation sir,
simple code gfg Euler Circuit Path
int isEularCircuit(int V, vectoradj[]){
vectordegree(V,0);
int odd=0;
int even=0;
for(int i=0;i

[@anshmohta6530]

it doest not check whether the graph is connected or not so incomplete code

[@than0s869]

nice explanation,
thank you sir... :)

[@kunalkumar9399]

Hats off man ❤️

[@alvinspark1875]

Great work dude.

[@alpishjain1317]

great explanation!

[@techdose4u]

Thanks :)

[@NoFormalities-y1k]

graph will be eular graph(or will have eular circuit) ,if and only if degrees of all vertices are even.
graph will contain eular path if and only if it contains exactly 2 odd vertices.

[@tarunbawari2858]

Sir please if possible make videos on network flow in graph also😅. Your videos are amazing and your explanation too.

[@techdose4u]

I think you are talking about maximal flow right? I will make it next week probably.

[@ramakrishnakcr4417]

super 👌

[@siddharthdwivedi3263]

In the find_Euler function ,before calling isconnected we can check if the number of odd degree vertex are greater than 2 ,and return false from there itself. Am I correct Surya?

[@sindhu3232]

Hi, Can you post a separate video on hamilton-cycle as well,Thanks.

[@aayush5474]

Sir it would be helpful if you can provide links to related problems on the topic in the description :)

[@techdose4u]

Okay. I will try to do it from next time.

[@swapnosanjogmohanty8920]

@@techdose4u atleast expalin one medium question on this topic and suggest 2-3 problems for practice it would be great,....❤️❤️ explanation is superb 🙏🙏

[@shobapandian]

Sir in blooms graph all the vertex is of degree 4 and it's connected graph....but it's not eulerian how? Plz can u explain.....

[@tobiahrex]

A Semi-Eulerian graph can't exist if your odd number of edges == 1. So it's incorrect to assume if odd-egdes != 0, and odd-edges !> 2, and odd-edges != 2, that a Semi-Eulerian graph exists as you're not checking if odd-edges == 1. Correct?

[@mouneydonuru2769]

A path is one in which no edges and vertices are repeated, but in euler path vertices are repeated, then which one is true, which one isn't?

[@pranavpundeer9022]

if odd==1, then it shouldnt be a Eulerian Graph or Semi Eulerian Graph, but according to the conditions (odd>2) and (odd==0)?2:1, it will be Semi Eulerian. Am i pointing this out right?

[@pawan_jaihind]

odd ==1 is not possible in undirected graph

[@AbhishekSingh-jp1hv]

If there is directed graph than there would be different approach? BTW great explanation 👌

[@perumallayaswanth83]

Seven bridges of konigsberg is a eulerian or semi eulerian??

[@sujoyseal195]

What if there is exactly 1 odd degree vertex and others are of even degree? In that case, will it also be semi-eulerian graph?

[@tobiahrex]

1 odd degree != Semi-Eulerian Graph. He has a 🐞 in his code.

[@anas_edits]

@@tobiahrex not possible to have 1 odd degree 19:14

[@anveshreddy9833]

if a vertex has 2 edges pointing into it, instead of one coming in and other going out, will this algorithm still work?

[@shouryasingh2193]

Just came here to like

[@techdose4u]

😀 Watch it too 😉

[@depression_plusplus6120]

Do you think it's a good idea to have a path set to store the path and return it...
Referring to question
7 bridges of Koningsberg

[@MASTERISHABH]

The 3rd example at 4:00 is a euler graph although not a euler circuit but it still is a valid euler path.
Check again!

[@adityaojha2701]

Euler graph is a graph having an Euler circuit. He said this at starting.

[@sabitaojha2871]

graph having euler path is not euler graph . to be an euler graph there must be euler circuit

[@raghugore3990]

Can u please provide solution and explanation for the below :
Write a program to find Largest 4 digits Prime Number whose Sum of Digits is also Prime.
1.Prime Number is any number that is divisible only by 1 and itself. Examples are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,........
2.Sum of Digits means sum of all the digits in that number. Example is number is 1234 then the sum of digits is 1+2+3+4=10

[@amitavamozumder73]

sorry to nitpick but it's pronounced as Oy-ler, not EU-ler

[@techdose4u]

I guess I mentioned that in the video about how it is pronounced and how I prefer.

[@amitavamozumder73]

@@techdose4u ​ ooh, either i missed or you're refering to some other video.

[@SHASHANKRUSTAGII]

its not YOOLER, its OILER

[@techdose4u]

I prefer to call it Euler. Not Oiler.

[@SHASHANKRUSTAGII]

@@techdose4u something is known as positive criticism. I hope you get me. Please do not take me otherwise.
Video was amazing.

[@techdose4u]

Yep :) No issue. I think I said in the video as well that I say yooler 😅

[@sneelakantan1]

hey Euler is pronounced as Oil-er, not U-ler.

[@techdose4u]

Thanks. But I like to say U-ler 😅

[@bhanujha1656]

code is wrong

[@Cruz0e]

I just have a small note here, his name is not pronounced "You-ler", he is swiss mathematician Leonhard Euler (/ˈɔɪlər/ OY-lər).
Other than this, its an other great video of you:D

[@original_gangsta_]

Excellent explanation

[@techdose4u]

Glad it was helpful!