6.12 Bridges(Cut Edge) in a Graph | Find All Bridges in a Graph | Graph Theory

In this video I have explained how to find all Bridges in a Graph using DFS Traversal. Bridge is also known as Cut Edge.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#graphtheory #bridgeinGraph #datastructures #jennyslectures

[@ravisingh-el8np]

can't be better explained watched take u forward video techdose video and love babbar video no video comes close to this . This video even beingg so old explains the concept clearly. Really old is gold. Keep up the good work mam.

[@shayideepsangam2832]

Best Explanation till now on KZbin for Finding Bridges in Graph!! Thanks a lot, Ma'am.

[@mahtoji8935]

I don't think that the explanation for this concept can be better than this .. If you watch any of the others youtube channel no one has explained this concept in such a beautiful wayy..... Salute to your Knowledge mam

[@luco-games]

I watched 10 different videos and understood only yours! Thank you SOOO MUCH!!! Greetings from Sydney :)

[@sanjayulsha]

Very well explained with thought process & intuition, struggled with other videos on youtube.

[@kartikagarwal5414]

this is by far the best explanation of this topic i have found online

[@mohammadsami3734]

imo, This is one of the most Well Explained YT Video of all time. Hats off to you Maam ❤❤

[@anushacheedella2291]

After seeing many videos for this problem...Only yours gave answer to my desperation .. thank you so much Jenny..

[@Page_Turners_Hub]

she teaches so amazingly , wondering why she has so less subs ? She deserves way more

[@UjjwalSingh-e6j]

okk let's be true, i am completing my DSA from love babbar playlist, although i've watched several of your videos earlier but it was mainly for my college subjects. And by god, this algo is so freaking hard, couldn't understand it by love babbar or any other video on youtube, but the way you presented it, it's just phenomenal. Hats off to you, you're the best. RESPECT++.

[@shubhamk840]

thank you so much, most detailed explanation on this topic all over youtube is here

[@inspired_enough_to_grow_up]

I approach a girl, she : 6:46

[@170_adityaanmol8]

haha

[@bitbyte8177]

Happens with me every-time when I approach any girl x(

[@goldent4655]

I was stressing out for the exam. Thanks for your comment haha

[@rajparekh08]

i don't think i will ever forget this algorithm - thanks to this :)

[@shoyaishida3605]

🤣😆

[@UnboxTheCat]

a comprehensive video that contains all the details, ++rep

[@asfahanahmad7959]

your way of teaching is good thank for this vedio

[@tanyagupta4247]

After trying to understand it so many times I came to youuu , explanation is best!!

[@SatyamEdits]

And we meet again!! 😂

[@vamshisamsetty186]

Ahh....Finally I understood the concept with your video. Thanks!!

[@hymnish_you]

Apologies, I never refer your videos to study. But from this video, I became your fan. Such a tough concept is explained beautifully. Here is Java code, did what Jenny said. ``` class Solution { private int currTime; Solution(){ this.currTime = 0; } public List criticalConnections(int n, List connections) { List[] graph = new ArrayList[n]; // Construction of graph for(int i = 0; i < n; i++){ graph[i] = new ArrayList(); } for(List connection : connections){ int first = connection.get(0); int second = connection.get(1); graph[first].add(second); graph[second].add(first); } int[] tIn = new int[n]; Arrays.fill(tIn, -1); List result = new ArrayList(); findBridges(graph, 0, -1, tIn, result); return result; } private int findBridges(List[] graph, int node, int parent, int[] tIn, List result){ tIn[node] = ++currTime; List nbrs = graph[node]; int min = tIn[node]; for(int nbr : nbrs){ int val = tIn[nbr]; if(val == -1){ val = findBridges(graph, nbr, node, tIn, result); if(parent != nbr) min = Math.min(val, min); if(val > tIn[node]){ result.add(Arrays.asList(node, nbr)); } } if(nbr != parent){ min = Math.min(min, tIn[nbr]); } } return min; } } ```

[@simakeshri5890]

Best explanation till now on KZbin

[@willturner3440]

I came here after more than 1 yr , you again rock ma'am 🤟 ..

[@Highlights_Point]

I don't know how can i thank you mam . know one in yt explain this concept perfect just like you

[@souradeepghosh5273]

ma'am you're fabulous. I watched so amny videos of tarjan's algo as well but couldn't understand. The way you explained. Hats off. You're the best

[@hope-jh7bv]

Thank you so much ma'am. You taught this complex topic so easily.

[@003abhinashkumarjha8]

no doubt this is the best explanation of finding bridge on youtube

[@sarthaksingh2145]

Understood it in one go...Amazing🔥🔥

[@wired.raskolnikov]

this helped me so much, thank you for your good work!

[@jaatharsh]

this is fabulous, most precise n clear explanation for Tarjan's algorithm

[@NohandleReqd]

Jenny! mai to tharro fan ban gaya!!! Thank you!

[@nandiniverma5273]

Mam, nobody explained the way you explained this bridges concept clearly. I was soo confused but you explained soo well. Thankyou soo much mam

[@mahimsd7645]

Excellent work Jenny !!!!!

[@priyanshsahu4901]

thank you mam for taking this example, it helped me understand algo better

[@2020naruto]

best explanation till now on youtube for finding bridges in graph....Thanks a lot ma'am....ma'am please also do with the code as if possible so that we don't need to find of its code . if we get confused some how ..?

[@jlecampana]

What a Fantastic Explanation!!! Thanks Jenny, you're an Angel.

[@bhavyashandilya2907]

Brilliant Explanation

[@ujjvalsharma5055]

This is such a great video and hats of to your explanation. Please keep up the good work and I must tell you that you are doing a great job :)

[@shivnathsinghgaur5972]

Thanks a lot, i have spent more time on that but now i got it.

[@ragavendradixit]

What an awesome explanation!

[@adipratapsinghaps]

Great explaination. I have seen so many videos. Yours was the simplest and the clearest. Can you also write the code?

[@sukritakhauri65]

Your Explanation is awesome

[@vikrantbharduaj1963]

Very nice mam Now I able to understand intitution and logic of this algorithm

[@peoplechoice7848]

coming here after watching striver/take u forward's video

[@aryanyadav3926]

Wonderful explanation!

[@arnavsatrusal2480]

Great explanation.

[@fanjiang6412]

Best and clearest explanation!

[@strgglr4637]

I don't know someone whose explanation on this topic is better than you.

[@maneeshkumarpatel9874]

But ma'am i don't know anyone who is better than you... love your lectures

[@udaysaiphanindra3138]

Thank you for this lecture.... well explained

[@ashfaqhussain761]

Best Explanation 👍

[@PankajYadav-oj9jz]

It was an amazing explanation mam. Love u😊

[@JennyslecturesCSIT]

Thanks Pankaj.... Thank you for the support. It’s great to be part of your success.

[@sayantaniguha8519]

@@JennyslecturesCSIT Can I have the code?

[@samirpandey8538]

Amazing explanation!!

[@madhupocham]

Very good explanation. Understood very well, and am able to write program all by myself. Thanks Mam.

[@mohitkumarbansal3486]

great explanation

[@manthenanagendra1077]

wow vey well explained

[@gemix3858]

A little correction. At 4:00, you said B can go to A only. But it can go to E too.

[@joshithmurthy6209]

Thank you for the detailed explaination

[@pacman46811]

Underrated!

[@rudrapratap3303]

nice explanation!!

[@kousthubhtadanki1237]

nice explanation!!!

[@chinmaytripurwar3222]

Great Explanation!

[@SreekantShenoy]

wew the best explanation.

[@PriyankaSingh-pn8xv]

Amazing explanation

[@hariohmprasath]

Thanks a lot for all your wonderful lectures

[@ashwanisharma8903]

TIP: Reason why we need to check of the current min time is greater than the next vertex :- If a vertex is having a child such that the earliest discovered vertex that can be reached from the vertices in the subtree rooted at has a discovery time greater than or equal to , then does not have a back edge, and thus will be an articulation point. where back edge is an edge which can connect to the parent of parent.

[@royalfalcon2021]

M phle see kisi ke sath connected hu I know someone who is better than you Mera koi ni kaat sakta Mko phle se kisi ne pakad rakha hai I have a BF These are not just Girls things, THIS IS GRAPH MAN Best video on Bridges in a Graph After so many lectures now I understand it

[@krishnachaitanya2520]

Great explanation! Thank you.

[@interesting.finds.1857]

Nice explanation mam

[@abinvarghese4153]

Very good explanation.

[@zohaib._.rehman03]

Thanks alot mam❤❤

[@vikrantbharduaj1963]

Amazing Mam

[@csedepartment236]

Thank You Ma'am

[@rakeshkumarbiswal9489]

best explanation

[@shivamverma9447]

excellent explanation 💯

[@rohitpal36]

awesome explanation maam

[@Shadow-lx9rh]

Thank you understood the concept very well. 🙏

[@somsk56]

well explained

[@vinodjain14]

superb explanation !!!

[@fahadisrar2195]

Your video is awesome. Thanks for helping us out.

[@gemix3858]

5:19 "What is the FANDA" XD Well Explained!!!

[@raghavgoel419]

You may call it "concept behind it"

[@bhaveshkumar6842]

Thanks for such a brilliant explanation!

[@nikunjgarg3754]

Very nice explanation ma'am. I don't understood about this find all bridges algo on other yt channels.

[@abhishekkumarjhariya1340]

Now I got the real intuition behind , why are we keep tracking of lowest visited time of adjacent vertices .Thanks for explanation.

[@piyushmishra860]

Tq so muchh mam 💖

[@deveshranjan6204]

really very nice explaination

[@cachegrk]

Well explained ! It would be nice to have the entire video in English! This can attract lot of international candidates.

[@marinamaher8211]

Great explanation,Thanks.

[@DrakeHDxgaming]

wow this took a while to abosrb. Its a mental gymnastic in my head at start

[@minhazarfin837]

It was Very helpful 😍

[@Funtura110]

Thank you!

[@vrajpatel1877]

Thanks 🙏🏽👍

[@marcus48134]

Good explanation. Thanks

[@rahulnagwanshi2348]

Jenny: "I know someone who is better than you because he came before you" Me: *crying in the corner*

[@ilfat_khairullin]

Thank you! Very good explanation!!!

[@ShaliniNegi24]

Thank you :)

[@tanmaiysethia176]

very well done , explain was simple and lucid

[@adityakr6124]

Very well explained :D Thanks!

[@mohanrajs9917]

Thank you so much mam

[@kayalvizhikalaichelvan5283]

Good explanation. Very Useful. Thanks a lot. :)

[@ayushijain3340]

Thank you so much!! Your videos have helped me alot :-). You are beauty with brains :--)

[@yt_se_yt]

Thanks

[@saurabhsinha8913]

Best explanation on difficult graph example

[@rishabkumar4940]

A lot of thanks, I was struggling to understand it.