View full-text article in PMC Sensors (Basel). 2018 Jun 15;18(6):1950. doi: 10.3390/s18061950 Search in PMC Search in PubMed View in NLM Catalog Add to search Copyright and License information © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). PMC Copyright notice Algorithm 1. DCMST algorithm. Input:V: Set of nodes; vk: Nodes; VG(vk): Set of nodes in tree G; EG(vk): Set of edges in tree G; Output:Tk: DCMST of the network G←|V|−|VG(vk)|−1 VG(vk)=EG(vk)=∅ S0={v0}∪VG(v0) E0=EG(v0) S0′=V{v0}∪VG(v0) Fork=1; k≤|V|do While vk neighbored v0 do VG(vk)=VG(vk)∪VG(v0) EndWhile While vk associated v0 do EG(vk)=EG(vk)∪EG(v0) EndWhile Sk:=Sk−1∪{vk−1′} Ek:=Ek−1∪{ek−1} Sk′=Sk−1′{vk−1′} If Sk=V then Tk=(Sk−1, Ek−1) Else w(ek)=mine∈[Ok, Ok′]w(e), ek=vkvk′ EndIf If [Sk, Sk′]=∅ then Tk=∅ EndIf EndFor