distance vector routing in tamil || computer networks || bellman ford algorithm. 

If any not understand this just think simple skip the formula then imagine the shortest distance between the nodes by the diagram then imagine with formula you can understand this easily👍

ma'am please make one for link state routing as well, this was very clear and concise

Vera level madam 🙂 keep rocking 🤩

@8:51 final state of A, last row hop should be D right?

Mam I have one doubt If the final state of node still infinity then what we do mam

Superb explanation 😊 mam

I try for 6 nodes(a,b,c,d,e,f) Node a only not getting the answer mam it still shows infinity mam

I try for 6 nodes(A,B,C,D,E,F) node A only not getting the answer mam it still be infinity

Link state routing algorithm video pottu irukingkala mam

can you give me pdf for link state routing protocol plsss, very uregnt

7:29 la 1+11=12

Super explanation

entire video wasn't audible , kindly talk loudly. 😇

Helped a lot

Thank you Mam

Thanks mam❤

Maam thanks a lot

Nala purinjathu mam

Supr ka 🙆

Too hard to understand the calculation 😢😢

Thanks mam

M̊åm̊ l̊i̊n̊k̊ s̊t̊åt̊e̊ r̊o̊ůt̊i̊n̊g̊ I̊ n̊e̊e̊d̊ m̊åm̊

1+11=14😂😂

very hard too understand