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:

=======================================================================

USEFUL LINKS:-

[chakradharkandula]

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

[arnavaggarwal]

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

[tarungulati]

The channel content is the best out there .

[sravya]

22:24 in case of odd==1, we will return 1 which means we are saying that it is semi euler graph but not correct


Thanks for the amazing explanation

[shubhamkhurana]

That's great, could not have been better

[nishugurung]

This was extremely helpful, thank you!

[awesomeamazing]

bhai tumne bahut sahi videos banaya hai

[NoFormalities-yk]

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.

[kp_nagar]

great explanation sir,

simple code gfg Euler Circuit Path


int isEularCircuit(int V, vector<int>adj[]){

vector<int>degree(V, 0);
int odd=0;
int even=0;
for(int i=0;i<V;i++){
degree[i]=adj[i].size();
if(degree[i]%2==0)even++;
else odd++;
}
if(odd==0)return 2;
if(odd!=2) return 0;
return 1;
}

[kushagrashekhawat]

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.

[thans]

nice explanation,
thank you sir... :)

[ApoorvaRajBhadani]

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

[siddharthdwivedi]

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?

[ajitsakri]

Thanks a lot sir, you explained it quite intuitive

[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!

[sindhu]

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

[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

[sabitaojha]

clear and detail explanation. huge appreciation

[aayush]

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

[mouneydonuru]

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?