6.5 Prim's Algorithm for Minimum Spanning Tree | Data Structures Tutorials

thank you jenny

Why would choosing A to C edge make sense while adding choosing node after say F ? Can someone please explain ?

Thank you so much mam for a wonderful explanation.

I have today exam 🙃

thank you so much jenny maam you are literally rhe reason i pass my exams you teach better than my faculty

You are beauty with brain

Speak English

❤

super mam i understood very well

mam subah se apko loop pe dekhra like puri dsa ki playlist khatam krdi kal exam hai islie😂😂😶‍🌫

can we connect more than 2 vertices in same 1 vertice? mam

Thank you so much

Thank alot ❤🎉

Ma'am you are my crush 💕

Thank you so much

Too much Hindi, Jennyjan : /

what is the difference between this and djikstra's algorithm for shortest path?

so clear that I usually play in 2 x speed

Boomer jenny

Bahut slow teach krte ho yaar

Nice mam , aap bahut acha padhate ho

Love you mam

ミヤチ

❤️

In parallel edge we delete maximum edge weight, so why u delete 3 instead of 6 pls explain ma'am

I have exam now and u saved us

NICE 🙂

Aik na

Mam you are looking so beautiful and your explaination is also so good hope you will reply my message I am waiting

Pls kindly use only English language for easy understanding

Thank u mam

Thank you so much mam

Mam please explain it with code also

Thank you

😍

what if i choosed D instead of F it comes again to C and all edges of C are already done then wht should we do?

I love you............................r way of teaching.

The eyes are so intimidating

hiiiii

thank you jenny❤️

cant understand the hindi part 😑

Kabhi has bhi Liya Karo didi 🙋🏻‍♂️

I Love you JennY 💗
u are saved my exam

Thank mam I got full marks for this topic and most of all
U are so cute mam

Watching her videos in 1.25 x speed is more comfortable

aap bajrang bali se kam nhi hai mam, sankat mochan hanumaan 👃👃👃👃👃

mam can u make a vd on algorithms

Madam you are cute

Why hindi 😑

Try to add captions to your videos.