Algorithm 4 calculate_rules

Input:  $adj\_mat$ Output:  $rules$    1:$rules\leftarrow \left[\right]$    2:Generate directed graph from $adj\_mat$    3:Remove edges with weight < $min\_rule\_perc$    4:Get connected components of the graph    5:for all  $connected\_component\in connected\_components$ do    6:    if  $size(connected\_component)>1$ then    7:       Sort nodes of the connected component graph by time    8:       Append the nodes to $rules$    9:    end if  10:end for  11:return  $rules$