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 multicomponent 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:   / suryapratapkahar47bb01168  

WEBSITE: https://techdose.co.in/

TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5...
=======================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/...
USEFUL LINKS:
PROOF: https://math.stackexchange.com/questi...
Kosaraju Algorithm:    • Kosaraju Algorithm | Strongly connect...