Euler Path | Euler Circuit | PART-3 | Graph Concepts & Qns - 42 | Explanation + Code
183iPad PDF Notes Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/iPad PDF Notes/Euler in Directed Graph - Part-3.pdf
Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
Hi Everyone, this is the 42nd video of our Playlist "Graph Concepts & Qns". This is one of the very popular topics in Graph as well as a very important topic in Graph.
We had already studied Euler Path/Circuit theory in video-40 and video-41 of this playlist.
This is Part-3 of the Euler series where we see how we deal with Euler in Directed Graphs.
Euler Part-1 : • Euler Path | Euler Circuit | PART-1 |...
Euler Part-2 : • Euler Path | Euler Circuit | PART-2 |...
Problem Name : Euler Path | Euler Circuit | PART-3 | Graph Concepts & Qns - 42 | Explanation + Code Topic : Graph Video : 42
Company Tags : GOOGLE (Variation asked with a Qn)
My DP Concepts Playlist : • Roadmap for DP | How to Start DP ? | ...
My Graph Concepts Playlist : • Graph Concepts & Qns - 1 : Graph will...
My Segment Tree Concepts Playlist : • Segment Tree | Introduction | Basics ...
My Recursion Concepts Playlist : • Introduction | Recursion Concepts And...
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Video Summary :
Euler Path in Directed Graphs
In this video, I explained how to determine the existence of an Euler Path in a directed graph using the relationship between the indegree and outdegree of nodes. The key points discussed are:
Conditions for Euler Path:
A directed graph contains an Euler Path if:
1) Exactly one node has: outdegree[node]−indegree[node]=1 This node is the starting node of the Euler Path.
2) Exactly one node has: indegree[node]−outdegree[node]=1 This node is the ending node of the Euler Path.
3) All other nodes must satisfy: indegree[node]=outdegree[node]
Eulerian Circuit:
If every node in the graph has: indegree[node]=outdegree[node] The graph contains an Eulerian Circuit (a closed Euler Path), and any node can be chosen as the starting point.
✨ Timelines✨
00:00 - Introduction
#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik