ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
you explain much better then my professor, thank you
Thanks for the compliment.
非常感谢,其他的印度人频道说话速度太快了,这里终于能听懂
欢迎。很高兴听到
Best video for tree back form and cross edge
Thanks a lot.
Excellent video very clear :)
THANKS A LOT,SIR💝
You're welcome.
thanks for this wonderful explanation🙏🙏🙏🙏🙏🙏
You're most welcome
thanks for this wonderful explaination
Great help during my endsems
Glad it was useful.
Backward edge connects between a Parent's parent , Forward edge connects between a Descendant's descendant . ,Tree edge is a connect between a parentAnd child ,Cross edge is a connect between two children's
brilliant explanation!
Glad you liked it!
Awesome explanation...
Thanks a lot 😊
Sir, if dfs traversal for directed graph is done in order: adecfb then b-c edge will be of which type?
Thank you for the great explanation!!!
PLease put these videos as a playlist titled 'Graph theory'
These are already in playlist: Graphs | Data Structures | Algorithms. Link: th-cam.com/play/PL1w8k37X_6L9IfRTVvL-tKnrZ_F-8HJQt.html
Thank you sir - helps very much.
Glad to know.
Nicely explained.
Thank you 🙂
helpful, thank you!
Glad you found it useful.
Thank you a ton
Glad it helped
Nice video
Thanks Sir!
Welcome.
okay, why my prof cant explain this concept like the way he does here?
Maybe because here it's just you and the video means here's no disturbance.
Are you Rauthan Sir?
Nope.
Thank you
Too good
Thanks.
what if c to a?
Similar to e to a
annotate詮釋
v v v
you explain much better then my professor, thank you
Thanks for the compliment.
非常感谢,其他的印度人频道说话速度太快了,这里终于能听懂
欢迎。很高兴听到
Best video for tree back form and cross edge
Thanks a lot.
Excellent video very clear :)
Thanks a lot.
THANKS A LOT,SIR💝
You're welcome.
thanks for this wonderful explanation🙏🙏🙏🙏🙏🙏
You're most welcome
thanks for this wonderful explaination
Great help during my endsems
Glad it was useful.
Backward edge connects between a
Parent's parent , Forward edge connects between a
Descendant's descendant . ,Tree edge is a connect between a parent
And child ,Cross edge is a connect between two children's
brilliant explanation!
Glad you liked it!
Awesome explanation...
Thanks a lot 😊
Sir, if dfs traversal for directed graph is done in order: adecfb then b-c edge will be of which type?
Thank you for the great explanation!!!
PLease put these videos as a playlist titled
'Graph theory'
These are already in playlist: Graphs | Data Structures | Algorithms.
Link: th-cam.com/play/PL1w8k37X_6L9IfRTVvL-tKnrZ_F-8HJQt.html
Thank you sir - helps very much.
Glad to know.
Nicely explained.
Thank you 🙂
helpful, thank you!
Glad you found it useful.
Thank you a ton
Glad it helped
Nice video
Thanks Sir!
Welcome.
okay, why my prof cant explain this concept like the way he does here?
Maybe because here it's just you and the video means here's no disturbance.
Are you Rauthan Sir?
Nope.
Thank you
Too good
Thanks.
what if c to a?
Similar to e to a
annotate詮釋
v v v