I know this question sounds silly, but I've been reviewing distance vector tables from this site
Specifically this example where the direct path is longer than an indirect. Is this possible and if so, what are the conditions for this to occur?
closed as off topic by Xavierjazz, terdon, Canadian Luke, Nicole Hamilton, Ƭᴇcʜιᴇ007 Mar 5 '13 at 17:45
Questions on Super User are expected to relate to computer software or computer hardware within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here. If this question can be reworded to fit the rules in the help center, please edit the question.
The path is not longer it is more costly. In the example you have posted, the edges are weighted. The table shows the cost of each path. Since the direct edge has a weight of 7, the direct path has a cost of 7. The indirect path has a cost of 4+1=5 so it is less costly even if it is shorter.
I don't know what kind of network you are describing so I cannot know what these weights represent but that is why the cost is cheaper for the indirect path. The weights could, fir example, refer to network speeds. So, if F->D->G takes 5 seconds and F->G takes 7, the indirect path is faster because it goes through a faster network.