Tree Edge - Member of DFS traversal. Forward Edge - Any edge ( x , y ) where y appears after x and there is a path from x to y. Back Edge - Any edge ( x , y ) where y appears before x and there is a path from y to x. Cross Edge - Any edge ( x , y ) would be a cross edge where there is no path from y to x. Carry on guys ❤
G 243 4 types of edges 1. tree edge: All traversed edge 2. forward edge: X appears before Y, direct path from x-y .(not belongs to tree edge) 3. back edge: Y appears before X, direct path from y-x .(not belongs to tree edge) 4. cross edge: X/Y appears before Y/X, direct path from y-x/x-y. (not belongs to tree edge) All the above edges added up to full graph
Really this video will clear all the concept and doubts. The content of this video is not available everywhere even in books. This type of explanation is done by some geneous and talented. Thank you so much from the bottom of my heart..
The ending part, "I'll see you in the next video. Till then bubbye, take care" of your videos is like the chocolatey tip of an ice cream cone.... Sweet!
I saw this video , felt it was too lengthy . Went to other websites for the concept . Then came back to this one and am thankful that I made the right choice.
Good and clear explanation. Thank you!!!. I got to know about traversals easily. One recommendation is that if you can publish the code using any language for theory it would be more good. I am happy with video contents. Thank you once again :)
aap bhut acha padhati ho ❤️u r so sweet 💝Mann krta hai ...din bhar data structures padhta rahuuu...24×7 ...aapki aawaj bhut pyari hai ...aur apka face to mashaallah ....aur apke hair style...aur aapp jb idhar dekhti ho ...to haaaye apki aakhe 😍😍😍❤️ 😘😘😘
My friend harsh kothari suggested me your channel ♥️ I found it too amazing in Lovex100 with your work & also you ♥️ Thank you mam..Keep the motivation on. 💪
one question >>will the number of tree edge , forward edge , back edge , cross edge remain same if we would have chosen different paths for the same graph?
very very helpful & comprehensible illustration ma'm..thanks a lot i had some meticulous dubiety upon this topic..your tutorial just gave me a clearance of my good concept now..
Very nice vedios but sometimes board is not visible may be due to reflection It's sometimes hard to note important points form board Otherwise everything is nice the way of your explanation is so understanding.
@@ayushkumarverma6895 EK sir ne bataya hai ki BFS spanning tree me cross edges aur DFS spanning tree me back edges hote hai.. Unhone undirected graphs par traversals kare hai. Please help !
URGENT DOUBT!!: Ma'am, while checking if there is a path or not to determine if it is a forward edge or back edge, is it compulsory that the path should contain only tree edges or is it fine if any edge in the path is not a tree edge?
In the video she also used the tree edge to determine the path from x to y or y to x she only named the edge that are not tree edge forward, back and cross edges.
@@somebodyoulove didn't understood what you are saying....can you plz tell shall we consider A)only tree edges for finding path or B)we can use other edges than tree edges also
@@sumitmahto7542 don't misguide anyone..it is possible in undirected graph also..tree edge and back edge is possible only cross and forward edge not possible
Is it compulsory to finish all edges of in the dfs traversal?if yes,then since multiple paths are present wont the total time vary for different selection of unvisited adjacent vertices?
In an undirected DFS tree, Tree edges and Back edges are present and in a directed DFS tree Tree edges, Back edges, Cross edges and Forward edges are present.
Nobody in the whole internet has explained this concept like you did :) Huge respect for you ma'am !!!!!!!
Finally a lecture that explains the algo and not just the explaination . Very Nicely explained.
Nice explanation. Thank you ! Greetings from Greece !!
Greetings from India
@@JennyslecturesCSIT greeting from Uttar Pradesh 🙏
@@JennyslecturesCSIT Greetings from Mirzapur.💝
@@shankeychauhan9523 bhai yeh India mei hi hai
Namaste 🇮🇳
Tree Edge - Member of DFS traversal.
Forward Edge - Any edge ( x , y ) where y appears after x and there is a path from x to y.
Back Edge - Any edge ( x , y ) where y appears before x and there is a path from y to x.
Cross Edge - Any edge ( x , y ) would be a cross edge where there is no path from y to x.
Carry on guys ❤
@@debarghyabandyopadhyay131 thanks☺️
after watching so many videos. finally i landed here... awesome teaching. now i got this concept very clearly. thanks. 😀
Same here.
G 243
4 types of edges
1. tree edge: All traversed edge
2. forward edge: X appears before Y, direct path from x-y .(not belongs to tree edge)
3. back edge: Y appears before X, direct path from y-x .(not belongs to tree edge)
4. cross edge: X/Y appears before Y/X, direct path from y-x/x-y. (not belongs to tree edge)
All the above edges added up to full graph
Not necessarily direct path...can be indirect path also... Only path should be there thats it
@@manavnagrani8338 but in this vdo Maam told direct path
Thanks a lot ♂️
Really this video will clear all the concept and doubts.
The content of this video is not available everywhere even in books.
This type of explanation is done by some geneous and talented.
Thank you so much from the bottom of my heart..
ho nice lecture..meahwhile i cracked jrf without preparation..and i wish u all the best for ur lecture series
Thanks. n congratulations..
@@JennyslecturesCSIT are you doing phd now?
@@JennyslecturesCSIT are you doing phd now?
The ending part, "I'll see you in the next video. Till then bubbye, take care" of your videos is like the chocolatey tip of an ice cream cone.... Sweet!
I saw this video , felt it was too lengthy . Went to other websites for the concept . Then came back to this one and am thankful that I made the right choice.
Thank You! Very well explained! Love from Michigan!
This girl is explaning this way better than this MIT Prof. ! cheers
Awesome explanation. 👍👍
This explanation is better than my college's professors.
Thnx mam you are doing so good .
Keep it up👍👍🙏
If I could, I would have Given 1 million likes on this video. Keep up :)
You tought better that our professor... Thanks
Good and clear explanation. Thank you!!!. I got to know about traversals easily. One recommendation is that if you can publish the code using any language for theory it would be more good. I am happy with video contents. Thank you once again :)
apu this video is the best on online about edge,,,,,,,now i think,if u dont stay!! love from bangladesh
best explanation ever, i aspire to become a professor like you
Your explanation will be understood by kindergartner child also . Thanks for such simple explanation.
aap bhut acha padhati ho ❤️u r so sweet 💝Mann krta hai ...din bhar data structures padhta rahuuu...24×7 ...aapki aawaj bhut pyari hai ...aur apka face to mashaallah ....aur apke hair style...aur aapp jb idhar dekhti ho ...to haaaye apki aakhe 😍😍😍❤️ 😘😘😘
Improve the video quality, i cannot see the text you write on board
Yeah I agree, but I am sure she is doing the best she can.
Come on, it's not even that difficult to figure out what's written if you're listening carefully.
Focus. Dude focus 😂
Is it a radio ? Or a youtube video ?@@AvishekPaulOnline
@@yosiflearning MP4. I think you have heard about it.
Thank you very much for such a wonderful lecture!
Next month my DS exam.
Greetings from China ♥
My friend harsh kothari suggested me your channel ♥️ I found it too amazing in Lovex100 with your work & also you ♥️ Thank you mam..Keep the motivation on. 💪
Maa'm you are a God of Datastucture 🙏
one question >>will the number of tree edge , forward edge , back edge , cross edge remain same if we would have chosen different paths for the same graph?
Hloo mam...i am a student of iiit....ur lectures are awesome...even our professor learn from ur videos, and teach them😅😂. Great work🙏
bro from which iiit?
Really mam u gave the best explanation. Best way of teaching
Mam jo aapne 24 steps describe kiye algo ke wo saare hame likhne honge including backtracking ???
You are doing good.your lectures are good to clear fundamentals.Thanks.
its not just good but exillent explanation
mam your teaching is super ,thank you
wish you were in our college i would have paid full fees with no regrets ....haha jokes apart your teaching skills are really good ....thank you ma'am
You explained this very smoothely maa'm.This was my very first seen video of your's channel...and it was osm:)
Outstanding explanation ❤
Such a great explanation !!
Thank u very much mam.
Thanks a lot Ma'am. It was really helpful. I was looking for a lecture like this to get a good grip on the concept of edge classification.
very very helpful & comprehensible illustration ma'm..thanks a lot
i had some meticulous dubiety upon this topic..your tutorial just gave me a clearance of my good concept now..
Very well explained ..
Wonderful explanation 😊😊😊
Everything is amazing...
Nice explanations mam. Aapsay achaw koi bhi nahi pada sakta thank you mam
Good bless you 😍😍🤗🤗
Read this concept from coreman earlier was not able to get it , your lectures made it simple thanks alot mam :) .
today my end sem exam , now i am this topic . great explaination mam 💌💌💌
Masterpiece teaching!
Nicely explained well satisfaction
Amazing mam!💃💃💃💃💃💃💃💃💃💃💃💃💃💃💃u r so awesome mam how well u taught😘😘thankyou mam!
Thank you Ma'm for this one!
Thanks a lot!!! Very helpful
Very clear explanation
if way of traversing differs, the edges and time stamp also will differ. right?
Thanks a lot for cool lecture)
thank you so much madam. your luck like sharuk khan's sister..
great explaination ! keep up the fantastic work
Baba g tusi great ho 😍
It's very helpful, thank you soo much mam.
u are the best !!!!
Very nice vedios but sometimes board is not visible may be due to reflection
It's sometimes hard to note important points form board
Otherwise everything is nice the way of your explanation is so understanding.
This video is not visible clearly mam🙄🙄...but ur way of explaining the subject was awesome 🤩🤩🤗🤗🤗
Very nice explanation madam.
Excellent explanation.
Ma'am
Is these (forword cross back) edges possible for directed graph or only for undirected graph???
Please resolve my doubt as soon as possible🙏🙏🙏
A depth first search on a directed graph can yield 4 types of edges; tree, forward, back and cross edges. No forward edges in undirected graph
@@ayushkumarverma6895 EK sir ne bataya hai ki BFS spanning tree me cross edges aur DFS spanning tree me back edges hote hai.. Unhone undirected graphs par traversals kare hai. Please help !
Thank u for your explanation. Amazing concept
You explained it really well. But, you should also explain the code for DFS and BFS, shouldn't you ?
Ya please do that please it is a gentle request from our side!
Excellent teachings
URGENT DOUBT!!: Ma'am, while checking if there is a path or not to determine if it is a forward edge or back edge, is it compulsory that the path should contain only tree edges or is it fine if any edge in the path is not a tree edge?
In the video she also used the tree edge to determine the path from x to y or y to x she only named the edge that are not tree edge forward, back and cross edges.
same doubt
@@somebodyoulove didn't understood what you are saying....can you plz tell shall we consider
A)only tree edges for finding path or
B)we can use other edges than tree edges also
Is the concept of types of edges applicable to undirected graph also ?? Please answer
never,
without direction how could u say anything
@@sumitmahto7542 don't misguide anyone..it is possible in undirected graph also..tree edge and back edge is possible only cross and forward edge not possible
Is it compulsory to finish all edges of in the dfs traversal?if yes,then since multiple paths are present wont the total time vary for different selection of unvisited adjacent vertices?
Jenny Ma'am Thankyou so much.... You are awesome
what is the use of learning the types of edges
perfection👌
Why not we can backtrack on f at 13:51
Amazing, thank you!
Maam keep rocking
ma`am how you're considering any element x and other element y....is there any process?
e:(x,y) means there is a directed edge connecting and pointing x to y, i.e., x -----> y :)
that was a good lecture !
Helpful one.
Why you didnt back track the node from h to f.Why f don't have final time??
according to timre we have to goto L but L and all others is already finished thats why g
Thank you sooooooooooooooo much🎉
Very good explanation 😊
Thank you nice video👍👍👍
Dhanyawad
Important point is "There is no CROSS EDGE" in an undirected graph!!
YEP!!rest all the other three edges are present in an undirected graph na ?
@@priyamraj122 tree edge is there, but forward and backward edges are same
@@jithinmv6516 ohkk bhai
In an undirected DFS tree, Tree edges and Back edges are present and in a directed DFS tree Tree edges, Back edges, Cross edges and Forward edges are present.
the lecture is about directed graph...
thank you so much mam. wonderful lecture
In case of undirected graph ?
itna hi bolunga....bhut hard bhut hard
outstanding !! Thanks
Great lecture. Graph thoda bada hai for my adhd :)
Thank you Madam 🙏
How will we find the edges in series of a particular graph?help me!!
The types of edges are only defined for dfs ? Not for bfs?? I mean is there any types of edges for bfs?
9:03 that f will be 11 (time)...if not why??
Been helpful
THANK U MAM,I WAS WATCHING U MORE THAN THE BOARD BTW..
Thank you so much Mam
Thanks ma'am 🥰
Thank you mam
Mam why you are didn't go for Bfs and DFS coding in c, I am searching for that in your lectures but I didn't find 😟☹️
Thank you!!!
Thanks Mam :)