how do you apply the algorithm in another scenario, you are in a node other than the root and want to find fastest way to root, for example you are in node C and want to find out the fastest way to the node A, you just take node C as root and start doing the same algorithm?
For anyone else, b to b is not 8, a to b is 8 {a,c,b}. All of the numbers with squares around them are distance relative to a, not relative to the letter in the left column
hat's off , for the best explanation . you are far better than any college professor's.
Watching this a night before my exams. Best explanation, thank you.
Thank you, this is one of the easiest videos for understanding this concept! You are a great teacher and I hope you find yourself well!
why can't my teacher teach like you...thank you bcs you make it easy for me to understand :)
I have my exam tomorrow.Was finding it difficult to understand the algo!
Thank you mam for explaining so nicely!
very simple to the point than other videos in yt . my exam is today
finally an explanation that makes sense! thanks !!
I love mam your teaching way is very gorgeous
Thank you madam for good teaching skills
Thankyou so much madam 🥰
Thank you so much ma'am. Very Nicely Explained.
Nice explanation, tqqsm mam😊❤
how do you apply the algorithm in another scenario, you are in a node other than the root and want to find fastest way to root, for example you are in node C and want to find out the fastest way to the node A, you just take node C as root and start doing the same algorithm?
Thank You Ma'am! It is really helpful
Very helpful for competitive exams
Zajhakillahu Khair Mam
❤
thnx mam very easy explanation
thaaanks a lot mam!!
how can A vertex be source if it has inward flow?
Very well explained
Clearly explained, thank you!
If ur volume be raised, then it's an excellent video
Great explanation
Why is b to b 8 ?
Via C
For anyone else, b to b is not 8, a to b is 8 {a,c,b}. All of the numbers with squares around them are distance relative to a, not relative to the letter in the left column
thanks for the explanation
Thank you 🙏
is this directed graph or undirected graph
Thanks mam
Thanks a lot mam❤❤❤
Thanks Ma'am
Well explained mam 🤗🤗🤗🤗🤗
Thank you maam
Well done mam, and thank u
Amazing!!!
Thank you so much mam
what about E in the final answer?
Thank you ..
Thora loud bool liyA karra please 🙏
U are greate mam
Thank you
mam plz upload more videos on data structure tutorial
Thanks mam❤️
Thanks .....!!!!!
why is "A" has not Direct Access with "E" ?
Because it's Directed graph not undirected
Thanks mam🙏🙏
Wow thanks
well explained
brillant
What if d(i)+c(i,j) > d(j) ??
then don't replace the value
But a is directly connected to e
Look at the arrow mark e is connected to a
source vertex A hai , aur vha E->Ase connect h but direction dekho.
❤❤
Please more clear in voice mam
please need large voice...
D is 11 not 9
A-c-b-d
Speak hindi
lmao
thank you so much ma'am.
that was well explained.
thank you mam
Thank you mam