Тёмный

Connected Components in Graphs 

take U forward
Подписаться 699 тыс.
Просмотров 116 тыс.
50% 1

Check our Website:
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: practice.geeks...
Code "takeuforward" for 20% off on sys-design: get.interviewr...?_aff=takeuforward
Crypto, I use the Wazirx app: wazirx.com/inv...
Take 750 rs free Amazon Stock from me: indmoney.oneli...
Earn 100 rs by making a Grow Account for investing: app.groww.in/v...
Linkedin/Instagram/Telegram: linktr.ee/take...
---------------------------------------------------------------------------------------------------------------------------------------------------- Pr-Requisites: Previous videos of Graph Series
Watch at 1.25x for best experience.
-------------------------------------------------------------------------------------------------------------------------------------------------
✅This is where I teach: ----- Use coupon-code "TAKEUFORWARD" for getting 10% on my course at GFG: bit.ly/striver_...
✅Use coupon-code "TAKEUFORWARD" for getting 10% for all GFG courses: bit.ly/tuf_gfgC...
-----------------------------------------------------------------------------------------------------------------------------------------------------
Checkout Educative: bit.ly/tufeduca...
You can use "TAKEUFORWARD10" coupon code while checkout...
Follow them on social media for all updates:
/ educativeinc​
/ ​
---------------------------------------------------------------------------------------------------------------------------------------------------
Please Please SUBSKRIIIBEEEEE the new channel: / @striver_79
If you appreciate the channel's work, you can join the family: bit.ly/joinFam...
Thumbnail Creator: / rikonakhuli
✅ Striver's Linkedin Profile: / ​
✅ Instagram: / ​
Connect with us: t.me/Competiti... (Use Link in Mobile only, if not works search "takeUforward" in telegram)..
#dsa​ #striversgraphchallenge​ #placements

Опубликовано:

 

27 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 58   
@takeUforward
@takeUforward 3 года назад
I will be posting a video every Sunday on the other channel, so bell DABAAAAA dena: ru-vid.com/show-UCvEKHATlVq84hm1jduTYm8g
@DhananjayKumar-vn5tc
@DhananjayKumar-vn5tc 2 года назад
sure bhaiya
@suwin1051
@suwin1051 3 года назад
Timestamp ---------------- 01:28 Connected Components in Graphs 02:00 Disconnected Graph : Component1 + Component2 + Component3 make up a single disconnected graph. Graph can be either single component or more than one components. 03:00 Even a single node can be called as a component. 03:30 Write code for multiple components whether it is DFS or BFS. 04:00 Take visited array and initialise as 0 for(int i = 0; i
@SatyamKumar-pd8qy
@SatyamKumar-pd8qy 2 года назад
Thanks brother❤
@adityakumawat9066
@adityakumawat9066 2 года назад
Thanks 👍
@prithvichetty15
@prithvichetty15 3 года назад
Hello Bhaiya, I have been your fan/subscriber since Feb 2021 and I am the most happy to find your channel and have been watching all your videos on DSA and topics you cover through the SDE sheet. I have only one request to make as your fan. I know you are also a working professional and it is tough for you to make videos but since I am from the 2022 batch my placement season will start in July or August. So I would like to request can you please complete the Tree and String part As soon as Possible please. This is just a request but it will benefit a number of students like me. Waiting for your reply. Thanking you and must tell you your content is best on RU-vid. Keep it up and keep helping students like us.
@harshit-jain.
@harshit-jain. 2 года назад
Hello Prithvi. Which company you got placed? Can we connect? I need some help, so please consider my request.
@praneeth9184
@praneeth9184 3 года назад
we can count the number of times the if statement is executed to get the number of components in a particular graph.
@utkarshvishwakarma7477
@utkarshvishwakarma7477 3 года назад
Much Needed Graph Series !
@shreelakshmi6890
@shreelakshmi6890 3 года назад
Great explanation! Never found this anywhere!!
@swatinawange5390
@swatinawange5390 3 года назад
Best explanation ever and whole series is amazing!!!!
@Shivanai_h
@Shivanai_h 2 года назад
Thank you so much striver for giving us such a brilliant series for free....Kudos to your efforts..I don't have words to thank you enough..but really really thankful for the series and best explanation 😊
@channelname4394
@channelname4394 2 года назад
Best explanation. understood , hope this channel reaches more people
@ece27jeeneshkumarchaudhary15
@ece27jeeneshkumarchaudhary15 3 года назад
Best ever graph series. Thanks, striver bhai...
@JavedKhan-uv3ru
@JavedKhan-uv3ru 3 года назад
I really love the series each and every explanation goes deep in my mind keep making
@surabhsaxena7928
@surabhsaxena7928 3 года назад
To be honest it feels worth spending time on your playlists.
@surajthapliyal9374
@surajthapliyal9374 3 года назад
whoaaa is this realy free??? best resource for learning graphs . HATS OFF!!
@y.so.sarthak
@y.so.sarthak 2 года назад
code were needed for this series
@bhaveshkumar6842
@bhaveshkumar6842 2 года назад
The greatest DSA content on RU-vid
@HimanshuYadav-yj4to
@HimanshuYadav-yj4to 3 года назад
The Best you can find on RU-vid :-)
@rohankademani6406
@rohankademani6406 3 года назад
i had one doubt how did u know before hand the map of nodes when we will be traversing the graph for firs time simple question how did u write the map of 10 will it be mentioned before hand.
@ARSHDEEPSINGH-ii2qy
@ARSHDEEPSINGH-ii2qy 3 года назад
The no. of nodes will be given in the question and we wrote the map for every node .
@aayushvatsa3903
@aayushvatsa3903 3 года назад
feels tough don't worry you are on the right channel
@hrushikeshkale68
@hrushikeshkale68 3 года назад
Is linked list a graph?
@vaibhavgupta1920
@vaibhavgupta1920 3 года назад
Bhaiya Pls Aisa hi same DP ke liye bna do Bahut Help ho jaegi I am struggling in DP
@kaushalpal8295
@kaushalpal8295 3 года назад
pls search aditya verma on youtube... u will find your solution
@shivangisrivastava1158
@shivangisrivastava1158 2 года назад
Love your content power and your voice.
@hemantranjan2297
@hemantranjan2297 3 года назад
How are you planning to get number of connected components with above explanation? I suppose you missed something!
@sravan8643
@sravan8643 3 года назад
good job and thanks for helping
@sujitpal4573
@sujitpal4573 3 года назад
Please make videos on Java & Data Structures
@mixshots1801
@mixshots1801 3 года назад
excellent explanation
@surajmaity6194
@surajmaity6194 2 года назад
Thank you so much
@DhananjayKumar-vn5tc
@DhananjayKumar-vn5tc 2 года назад
u are doing great bhaiya
@helloworldkhalid
@helloworldkhalid 2 года назад
thanks
@krushnapatil9196
@krushnapatil9196 3 года назад
1:30
@helloworldkhalid
@helloworldkhalid 3 года назад
good explanation striver
@vishalgatla4606
@vishalgatla4606 2 года назад
Thanks.striver
@PrashantSingh-jy6zp
@PrashantSingh-jy6zp 3 года назад
go to 1:26
@lakshayrastogi7640
@lakshayrastogi7640 3 года назад
bhai feel agyi! thanks @striver bhiya
@radhe1335
@radhe1335 3 года назад
Mauj kardi Bhai 😁
@sehajanand7380
@sehajanand7380 3 года назад
how to differentiate between the node exists as an alone component and node don't exist at all , as they have a same representation (empty adjacency list ) , problem arises as not existed node increments the component' fs count value..
@takeUforward
@takeUforward 3 года назад
You will always go inside if statement
@sehajanand7380
@sehajanand7380 3 года назад
@@takeUforward remove the 6-8 edge and then check , answer will be 4 , but real ans is 3
@takeUforward
@takeUforward 3 года назад
@@sehajanand7380 a single node is a component
@LORDGULSHAN
@LORDGULSHAN 3 года назад
Big fan 💪✌️⭐⭐💯👕
@chetantyagi2576
@chetantyagi2576 2 года назад
understood
@rajdave9862
@rajdave9862 3 года назад
I pay you by watching the full advertisement
@PrayasBhatnagar
@PrayasBhatnagar 2 года назад
The ad is inbuilt in most of he videos. It is frustrating and breaks the flow. Quality of the content is compromised due to this.
@takeUforward
@takeUforward 2 года назад
just skip 1 minute, thanks.
@VivekJaviya
@VivekJaviya 3 года назад
Done!
@kusumjoshi4613
@kusumjoshi4613 2 года назад
awesome
@ajayypalsingh
@ajayypalsingh 2 года назад
💯
@PritamKumar-mr5dv
@PritamKumar-mr5dv 3 года назад
done
@saurabhkumarsingh9550
@saurabhkumarsingh9550 3 года назад
👌🏻👌🏻👌🏻👌🏻
@gokulnaathb2627
@gokulnaathb2627 3 года назад
@indsonusharma
@indsonusharma 2 года назад
1:26
@radhe1335
@radhe1335 3 года назад
Mauj kardi Bhai 😁
@divyansh2212
@divyansh2212 2 года назад
understood
Далее
G-4. What are Connected Components ?
7:07
Просмотров 247 тыс.
На самом деле, все не просто 😂
00:45
Random Emoji Beatbox Challenge #beatbox #tiktok
00:47
Kruskal's Algorithm
12:13
Просмотров 101 тыс.
Explaining Components of Graphs | Graph Theory
8:05
Просмотров 18 тыс.
How I Mastered Data Structures and Algorithms
10:45
Просмотров 228 тыс.