- <init>
- getDefaultSteinerTree
- getLabeledSteinerTree
- step1
Construct the complete undirected distance graph G1=(V1,EI,d1) from G and S.
- step2
Find the minimal spanning tree, T1, of G1. (If there are several minimal
spanning trees, pick an arb
- step3
Construct the subgraph, Gs, of G by replacing each edge in T1 by its
corresponding shortest path in
- step4
Find the minimal spanning tree, Ts, of Gs. (If there are several minimal
spanning trees, pick an arb
- step5
Construct a Steiner tree, Th, from Ts by deleting edges in Ts,if necessary, so
that all the leaves i