Skip to main content
. 2022 Sep 15;22(18):6980. doi: 10.3390/s22186980
Algorithm 5 elaborate_day
Input:  input_data
Output:  rules
  •    1:

    temp_adj NxN zero matrix with N = size(nodes_ids)

  •    2:

    for all  source_rowinput_data

  •    3:

        source_nodeget_node(source_row,temp_adj)

  •    4:

        related_rowsget_related_rows(source_node,input_data,max_t)

  •    5:

        for all  related_rowrelated_rows do

  •    6:

            related_nodeget_node(related_row,temp_adj)

  •    7:

            temp_adj[source_node.s_id][related_node.s_id]=1

  •    8:

        end for

  •    9:

    end for

  •  10:

    adj_mat(adj_mat+temp_adj)/2mult

  •  11:

    Rounds to 0 the adj_mat values less than min_perc

  •  12:

    rulescalculate_rules(adj_mat)

  •  13:

    return  rules