<div>
i wonder one thing. They never mention the source and destination. So how can we apply shortest path algorithm? 
</div>


i wonder one thing. They never mention the source and destination. So how can we apply shortest path algorithm?

<div>
You said yourself that the trees were &quot;for leftmost router&quot;. So, that's the destination in all three trees.<br />
<br />
Dijkstra's algorithm finds the shortest paths between all sources and that destination.
</div>


You said yourself that the trees were "for leftmost router". So, that's the destination in all three trees.

Dijkstra's algorithm finds the shortest paths between all sources and that destination.

<div>
&quot;for the leftmost router&quot; is the term &nbsp;from the book hihi
</div>


"for the leftmost router" is the term  from the book hihi

<div>
Either way - it answers your question about what the destination is ;)
</div>


Either way - it answers your question about what the destination is ;)

<div>
<div class="content wysiwyg-content">
Hi all,<br />
in the pix, a: a network, b: a spanning tree for leftmost router, c : a multicast tree for group 1, d: a multicast tree for group 2.<br />
<br />
can you help me to derive algrogithm or pseudocode how to come up with b and c. Tks.<br />
<br />
<a href="https://filedb.experts-exchange.com/incoming/2011/04_w16/442540/spanning-tree.png" target="_blank" class="file-inline" title="spanning tree (47 KB)"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path d="M67.508 468.467c-58.005-58.013-58.016-151.92 0-209.943l225.011-225.04c44.643-44.645 117.279-44.645 161.92 0 44.743 44.749 44.753 117.186 0 161.944l-189.465 189.49c-31.41 31.413-82.518 31.412-113.926.001-31.479-31.482-31.49-82.453 0-113.944L311.51 110.491c4.687-4.687 12.286-4.687 16.972 0l16.967 16.971c4.685 4.686 4.685 12.283 0 16.969L184.983 304.917c-12.724 12.724-12.73 33.328 0 46.058 12.696 12.697 33.356 12.699 46.054-.001l189.465-189.489c25.987-25.989 25.994-68.06.001-94.056-25.931-25.934-68.119-25.932-94.049 0l-225.01 225.039c-39.249 39.252-39.258 102.795-.001 142.057 39.285 39.29 102.885 39.287 142.162-.028A739446.174 739446.174 0 0 1 439.497 238.49c4.686-4.687 12.282-4.684 16.969.004l16.967 16.971c4.685 4.686 4.689 12.279.004 16.965a755654.128 755654.128 0 0 0-195.881 195.996c-58.034 58.092-152.004 58.093-210.048.041z"/></svg>spanning-tree.png</a>
</div>
</div>


spanning-tree.png

Hi all,
in the pix, a: a network, b: a spanning tree for leftmost router, c : a multicast tree for group 1, d: a multicast tree for group 2.

can you help me to derive algrogithm or pseudocode how to come up with b and c. Tks.


spanning tree

C is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, so it has found lasting use in applications that had formerly been coded in assembly language, including operating systems as well as various application software for computers ranging from supercomputers to embedded systems. It is distinct from C++ (which has its roots in C) and C#, and many later languages have borrowed directly or indirectly from C.

C++ is an intermediate-level general-purpose programming language, not to be confused with C or C#. It was developed as a set of extensions to the C programming language to improve type-safety and add support for automatic resource management, object-orientation, generic programming, and exception handling, among other features.