Skip to main content
. 2018 Jun 15;18(6):1950. doi: 10.3390/s18061950
Algorithm 1. DCMST algorithm.
  1. Input:V: Set of nodes; vk: Nodes; VG(vk): Set of nodes in tree G; EG(vk): Set of edges in tree G;

  2. Output:Tk: DCMST of the network

  3. G|V||VG(vk)|1

  4. VG(vk)=EG(vk)=

  5. S0={v0}VG(v0)

  6. E0=EG(v0)

  7. S0=V{v0}VG(v0)

  8. Fork=1; k|V|do

  9.   While vk neighbored v0 do

  10.    VG(vk)=VG(vk)VG(v0)

  11.   EndWhile

  12.   While vk associated v0 do

  13.    EG(vk)=EG(vk)EG(v0)

  14.   EndWhile

  15.   Sk:=Sk1{vk1}

  16.   Ek:=Ek1{ek1}

  17.   Sk=Sk1{vk1}

  18.   If Sk=V then

  19.    Tk=(Sk1, Ek1)

  20.   Else w(ek)=mine[Ok, Ok]w(e), ek=vkvk

  21.   EndIf

  22.   If [Sk, Sk]= then

  23.    Tk=

  24.   EndIf

  25. EndFor