Hello folks, I am not too sure whether it is the right forum for algorithm or not, if not please let me know! I have just read something about distance vector routing algorithm in a java book. But I am still not too sure how it works and the idea behind it. Does it take the distance between a to b to c to d and print the distance to the table or something? or does it take like the lowest cost of going from a to d or from a to c? I am confused and have no idea about this. Your help in explaining it in detail will be much appreciated and if possible, is there any example of this that I can look at and try to understand it better? It will help me alot in understanding if I see examples with explanations!
Increasingly, people seem to misinterpret complexity as sophistication, which is baffling - the incomprehensible should cause suspicion rather than admiration. Possibly this trend results from a mistaken belief that using a somewhat mysterious device confers an aura of power on the user. Niklaus Wirth