6.4 Minimum Spanning Tree | Properties of MST | Data Structures Tutorials

6.4 Minimum Spanning Tree | Properties of MST | Data Structures Tutorials

Jenny's Lectures CS IT

5 лет назад

611,655 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

@Jay_Pee
@Jay_Pee - 19.01.2024 22:26

👍

Ответить
@Rahul.r.r_p
@Rahul.r.r_p - 13.01.2024 15:11

Day 63

Ответить
@saisampath6942
@saisampath6942 - 29.12.2023 20:30

mam,please explain the programmes (codes) for graphs 🤌

Ответить
@UNIQUETOPFACTS
@UNIQUETOPFACTS - 24.12.2023 23:03

sokar utha phle

Ответить
@ishantsingh122
@ishantsingh122 - 05.12.2023 14:41

how to calculate weight of edges??

Ответить
@starlingff9026
@starlingff9026 - 30.11.2023 11:19

your video is good mam but the video quality is very poor

Ответить
@multi_gaming789
@multi_gaming789 - 29.11.2023 15:17

Give some nice reaction on video

Ответить
@adnanrizvi545
@adnanrizvi545 - 27.11.2023 08:59

Mam U r beauty with most beautiful brain

Ответить
@yedukondalug7933
@yedukondalug7933 - 13.11.2023 20:00

Good Explanation, super

Ответить
@mukultanwar8468
@mukultanwar8468 - 05.11.2023 12:08

beauty with brain

Ответить
@mihirrkumar
@mihirrkumar - 04.10.2023 13:00

Thank you

Ответить
@destiny8597
@destiny8597 - 08.08.2023 11:28

Love u mam 😍😗🤗

Ответить
@vanisurada5633
@vanisurada5633 - 23.07.2023 09:14

Tq mam for explaining us

Ответить
@mr_suryak4105
@mr_suryak4105 - 18.06.2023 13:50

Nice❤

Ответить
@RajKumar-jk9dm
@RajKumar-jk9dm - 10.06.2023 17:27

Also explain the complexity of these algorithms like Kruskal, Prims and Dijk stra , which one is better algorithm in average case ,best case and worst case

Ответить
@thomasyang8983
@thomasyang8983 - 08.06.2023 20:40

you are so smart

Ответить
@saptarshichattopadhyay8234
@saptarshichattopadhyay8234 - 07.06.2023 19:31

When I come here to learn something, I do not check comment section....Thank you so much Madam.... ❤❤❤❤❤❤❤

Ответить
@itzajgamer
@itzajgamer - 28.05.2023 20:51

My crush changed

Ответить
@bokamsriramteja6228
@bokamsriramteja6228 - 23.05.2023 07:52

Mam I love you 💟😘😘😘

Ответить
@user-wo9gc4uy1p
@user-wo9gc4uy1p - 09.05.2023 14:46

rahul is telling "hi"

Ответить
@sameergairhe679
@sameergairhe679 - 21.04.2023 07:47

Your eyes are very beautiful 😍

Ответить
@banothuthirupathi6269
@banothuthirupathi6269 - 10.04.2023 18:37

Q

Ответить
@nksingh1132
@nksingh1132 - 20.01.2023 21:30

What if mam explained in Hindi...the way she explained is awesome..if it could be in Hindi the more awesome

Ответить
@sanskarsolanki1221
@sanskarsolanki1221 - 15.01.2023 10:07

Mem ur are looking so beautiful❤️
Thanku

Ответить
@brown.girl_tani_
@brown.girl_tani_ - 14.01.2023 12:58

What is n here ?

Ответить
@syambabu9987
@syambabu9987 - 12.01.2023 07:51

very use full madam

Ответить
@68_sujatashitole28
@68_sujatashitole28 - 03.01.2023 20:27

Just wow ❤️

Ответить
@Royalnerd00
@Royalnerd00 - 25.12.2022 19:05

my focus is more on u then vedio plz help🥲

Ответить
@praveenseenu9472
@praveenseenu9472 - 21.12.2022 17:24

Yakkav nee solldrathu onnume puriyala kka suma suma fine mattum soldra po kka

Ответить
@rajesht9702
@rajesht9702 - 04.12.2022 09:53

Thank You Madam 🙏

Ответить
@CyrilCyrilDB
@CyrilCyrilDB - 03.12.2022 16:13

Great job, keep it up

Ответить
@pranjaltiwari8470
@pranjaltiwari8470 - 22.11.2022 06:53

Maam I am mechanical student but by your lecture video I managed to study my data structure

Ответить
@VAMSIKRISHNA-sm2si
@VAMSIKRISHNA-sm2si - 20.11.2022 07:21

🤝

Ответить
@vinayakpuri3855
@vinayakpuri3855 - 19.11.2022 14:56

Thanks mam 😊

Ответить
@paragggoyal1552
@paragggoyal1552 - 29.08.2022 17:06

That last property why is it written maximum, shouldn't the term used be 'exactly' in place of 'maximum'?

Also, why only complete graph, won't all connected graphs holds that property true?

e - n + 1 = e-(n-1).
and (n-1) is the number of edges in a spanning tree, therefore, in all connected graphs having 'e' edges, we have to remove 'e-(n-1)'. == 'e-n+1'. Exactly.

Am I wrong??
Please reply.

Ответить
@mohanroxx4205
@mohanroxx4205 - 27.08.2022 10:42

Love ❣️ from vizag😍😍

Ответить
@alikhasanov7940
@alikhasanov7940 - 01.07.2022 15:04

i have started learning DS and hindi in her DS lectures , very efficient )))

Ответить
@Real-Life-Nuggets
@Real-Life-Nuggets - 30.06.2022 17:45

Please consider a lecture on string matching techniques <3

Ответить
@yahyealcadaala3983
@yahyealcadaala3983 - 28.06.2022 08:57

Somaliya inta wx ka fahmi waya wxn raba naag hindi ina wx ka fahmo 🤣🤣🤣wxle jiro

Ответить
@awaisaslam5284
@awaisaslam5284 - 19.06.2022 21:23

Tomorrow is my terminal exam and this helps me completely, now I'm going for merge sort and insertion sort.
Thanks and respect for this. 👍👏

Ответить
@ksriram1997
@ksriram1997 - 17.06.2022 21:41

🖤🔥

Ответить
@teamorigin9289
@teamorigin9289 - 19.05.2022 17:45

i avoid Jennie ' s video to , avoid clicking it

Ответить
@hardikanand6153
@hardikanand6153 - 04.05.2022 23:16

What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?

Ответить
@mr.gymaholic6858
@mr.gymaholic6858 - 02.05.2022 19:37

Mam is so cuuuutee 🥺🥺🥺🥺

Ответить
@muneebayubmir157
@muneebayubmir157 - 19.03.2022 20:31

❤️

Ответить
@adilandagi1207
@adilandagi1207 - 11.03.2022 21:53

Where is the code for these explanation?

Ответить
@tahirnawaz5989
@tahirnawaz5989 - 02.03.2022 09:13

Thanks a lot, this very helpful for me,,.

Ответить