Given is graph with networks and bridges/switches. We know, the root Bridge is the bridge with the minimal Bridge-ID. The connections between every bridge and network is 1.

In the lecture slides they calculated the "best"(shortest) path from one network to the root bridge. I assume they used BFS, because it would be the easiest way to calculate the shortest path, but if they used BFS, why is the algorithm called Spanning-Tree-Algorithm?

  • $\begingroup$ What is the algorithm you are referring to? $\endgroup$ – hengxin Jun 11 '17 at 12:38
  • $\begingroup$ @hengxin I am sorry, it is a protocol: en.wikipedia.org/wiki/Spanning_Tree_Protocol $\endgroup$ – M.Mac Jun 11 '17 at 12:44
  • 2
    $\begingroup$ Quote from the wiki "The cost of traversing a path is the sum of the costs of the segments on the path. Different technologies have different default costs". BFS only is not sufficient for computing shortest path on weighted graphs. $\endgroup$ – hengxin Jun 11 '17 at 12:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.