# Constructing steiner tree

Given 4 nodes with edge values as stated below, is it possible to build a minimum spanning tree using Steiner tree?

    [0] [1] [2] [3]
[0]
[1] 110
[2] 118 121
[3] 140 238 152

-
Your question is very vague. Please clarify what exactly do you want to accomplish. – Jernej Jan 4 at 10:08
Could you please elaborate on why you want to use a Steiner tree? (E.g. include a reference to a text with this or a similar problem.) Although my trigonometry is a bit rusty, I think these distances cannot be realised in a 2D plane, which suggests this is not a Steiner tree problem. – Douglas S. Stones Jan 4 at 10:43