| http://www.w3.org/ns/prov#value | - This is because only lowest cost route neighbors within a network are neighbors within a spanning tree; see for example nodes B and D which are neighbors in the network shown in FIG. 3 but which are not neighbors on the spanning tree shown in FIG. 4.
|
