Skip to main content
. 2013 Apr 30;14:144. doi: 10.1186/1471-2105-14-144

Figure 1.

Figure 1

Illustration of the shortest paths heuristic: The algorithm starts with an arbitrarily picked terminal a (left). Then the terminal (f) closest to a is picked and the shortest paths connecting a to f added to the temporary Steiner tree G′ (middle). The algorithm proceeds by finding the terminal (g) closest to all nodes in G’. Accordingly, the shortest path from f to g is added to G′ (right).