Skip to main content
. 2018 Mar 20;18(3):927. doi: 10.3390/s18030927
Algorithm 1 MST calculation.
  • 1:

    Distances(i,j)=pi−pj

  • 2:

    Communicables(i,j)=Distances(i,j)≤r

  • 3:

    MST_Graph =zeros(nxn)

  • 4:

    MST_Nodes =1

  • 5:

    while length(MST_Nodes)≤(n−1) do

  • 6:

        for all i∈ MST_Nodes do

  • 7:

            Candidates =find(Communicables(MST_Nodes(i),:))

  • 8:

            for all j∈ Candidates do

  • 9:

               if ∃ MST_Nodes = Candidates(j) then

  • 10:

                   MST_Graph(MST_Nodes(i),Candidates(j))=0

  • 11:

                   MST_Graph(Candidates(j),MST_Nodes(i))=0

  • 12:

               else

  • 13:

                   Curr_Distance =Distances(MST_Nodes(i),Candidates(j))

  • 14:

                   if Curr_Distance < Best_Distance then

  • 15:

                       Best_Distance = Curr_Distance

  • 16:

                       Best_Candidate = Candidates(j)

  • 17:

                       Best_Source = MST_Nodes(i)

  • 18:

                   end if

  • 19:

               end if

  • 20:

            end for

  • 21:

        end for

  • 22:

        MST_Nodes =append(Best_Candidate)

  • 23:

        MST_Graph(Best_Source,Best_Candidate)=1

  • 24:

        MST_Graph(Best_Candidate,Best_Source)=1

  • 25:

    end while