49.

#linkstate, #dijkstra Link State Routing -Dijkstra's Algorithm - Unicast Routin

[@KanishH-v3z]

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.

[@preethij427]

Thank you for your kind words! I'm glad you find the content easy to understand.

[@KanishH-v3z]

cani i get your number pls @@preethij427

[@janakiramgowdnaidu1101]

Thank you mam for the simple and easy way od explanation

[@preethij427]

You’re welcome…

[@sachinshetty6907]

Last moment you won by teaching and I won in result🎉🙏

[@preethij427]

Thank you

[@ppujeth7389]

in dijkstras algorithm we can reach E through A->C->F-> with cost 5 less than 7

[@preethij427]

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.

[@hariharanbuddha7958]

I think For A...D is also a neighbour

[@preethij427]

Indeed, A and D are neighbors.

[@ardent307]

Yes

[@SaiKumar-bz1ps]

S

[@apurvmusandi9992]

Yes, u are right

[@apurvmusandi9992]

Yes, u are right

[@RafiZubayer]

Where's the A to D node cost mam?

[@Alfiya-k9i]

Thnk you mam❤

[@preethij427]

You're welcome!

[@Luffy_2804]

thx

[@preethij427]

Thank u for your feedback

[@tanishazaman-kx7ry]

5:27

[@Phenomenal-shiv]

Mam a to d node cost?

[@alial-obaidi9527]

can you upload your notes?

[@LakshmanS-s1x]

Where is A to D cost mam??