In the Dijkstra algorithm walkthrough, at 9:03 minutes, In the third row of the table, the already visited nodes in the tree is { A, B, C}. To reach the other nodes in the network using the already visited tree, the correct minimum distance from A to E is 7 (A to B: 3 + B to E: 4). Additionally, in the fourth row {A, B, C, F}, the minimum distance to E is 5. { A -> E -> F } is 5.
you are taking in a good way and it is very easy to understand also i thank you from the bottom of my heart. ones i thank you.
Thank you for your kind words! I'm glad you find the content easy to understand.
cani i get your number pls @@preethij427
Thank you mam for the simple and easy way od explanation
You’re welcome…
Thank you mam for explaining it in an easy manner.
Most welcome 😊
Last moment you won by teaching and I won in result🎉🙏
Thank you
Vtu ?
in dijkstras algorithm we can reach E through A->C->F-> with cost 5 less than 7
In the Dijkstra algorithm walkthrough, at 9:03 minutes, In the third row of the table, the already visited nodes in the tree is { A, B, C}. To reach the other nodes in the network using the already visited tree, the correct minimum distance from A to E is 7 (A to B: 3 + B to E: 4).
Additionally, in the fourth row {A, B, C, F}, the minimum distance to E is 5. { A -> E -> F } is 5.
THANK YOUU SOO MUCHHH
Happy to help
D can also come for the root node A mam
I think For A...D is also a neighbour
Indeed, A and D are neighbors.
Yes
S
Yes, u are right
Yes, u are right
Where's the A to D node cost mam?
ha bro thats a mistake
by her
but anyways good explanation
❤
Mam a to d node cost?
sir edhu CN la varuma
Yes
can you upload your notes?
5:27
Thanks
You're most welcome
Thnk you mam❤
You're welcome!
thx
Thank u for your feedback
Thank you mam ❤
Most welcome 😊
Where is A to D cost mam??