To reach from source node to destination node and taking neighbour nodes which are shortest among them and show in formation in a table.

i have 20 nodes.but i want to visited that node which is near to source node,then i will take visited node as source node and so on in other nodes to reach at final destination node using dsdv protocol.again i have to make a table to show the information about visited node and update it sequentially.answer it.

[Walter Roberson]

How does this question differ from your earlier question http://www.mathworks.co.uk/matlabcentral/answers/110806-how-i-visit-one-node-to-another-using-shortest-path-and-reach-the-destination-and-show-visited-node ?

[Walter Roberson]

http://en.wikipedia.org/wiki/Destination-Sequenced_Distance_Vector_routing