Комментарии:
👍
ОтветитьDay 63
Ответитьmam,please explain the programmes (codes) for graphs 🤌
Ответитьsokar utha phle
Ответитьhow to calculate weight of edges??
Ответитьyour video is good mam but the video quality is very poor
ОтветитьGive some nice reaction on video
ОтветитьMam U r beauty with most beautiful brain
ОтветитьGood Explanation, super
Ответитьbeauty with brain
ОтветитьThank you
ОтветитьLove u mam 😍😗🤗
ОтветитьTq mam for explaining us
ОтветитьNice❤
Ответить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
Ответитьyou are so smart
ОтветитьWhen I come here to learn something, I do not check comment section....Thank you so much Madam.... ❤❤❤❤❤❤❤
ОтветитьMy crush changed
ОтветитьMam I love you 💟😘😘😘
Ответитьrahul is telling "hi"
ОтветитьYour eyes are very beautiful 😍
ОтветитьQ
ОтветитьWhat if mam explained in Hindi...the way she explained is awesome..if it could be in Hindi the more awesome
ОтветитьMem ur are looking so beautiful❤️
Thanku
What is n here ?
Ответитьvery use full madam
ОтветитьJust wow ❤️
Ответитьmy focus is more on u then vedio plz help🥲
ОтветитьYakkav nee solldrathu onnume puriyala kka suma suma fine mattum soldra po kka
ОтветитьThank You Madam 🙏
ОтветитьGreat job, keep it up
ОтветитьMaam I am mechanical student but by your lecture video I managed to study my data structure
Ответить🤝
ОтветитьThanks mam 😊
Ответить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.
Love ❣️ from vizag😍😍
Ответитьi have started learning DS and hindi in her DS lectures , very efficient )))
ОтветитьPlease consider a lecture on string matching techniques <3
ОтветитьSomaliya inta wx ka fahmi waya wxn raba naag hindi ina wx ka fahmo 🤣🤣🤣wxle jiro
Ответить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. 👍👏
🖤🔥
Ответитьi avoid Jennie ' s video to , avoid clicking it
ОтветитьWhat is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
ОтветитьMam is so cuuuutee 🥺🥺🥺🥺
Ответить❤️
ОтветитьWhere is the code for these explanation?
ОтветитьThanks a lot, this very helpful for me,,.
Ответить