Algorithm 1. EMI.

Input:

$G=\left(V,E,W\right)withn=\left|V\right|,m=\left|E\right|,q=\left|W\right|$

Output:

Ranked nodes with overall importance value

Begin algorithm

1:  If G is directed or weighted:

2:  For node $v_i$ in $\mathrm{V}$

3:    compute structural entropy centrality ${\mathrm{S}}_i^{in}$, ${\mathrm{S}}_i^{out}$, and $S_i$

4:    compute interactive entropy centrality ${\mathrm{I}}_i^{in}$, ${\mathrm{I}}_i^{out}$, and $I_i$

5:    compute mutual power $M{I}_i$

6:    compute overall importance $K_i$

7:  Else

8:    For node $v_i$ in $\mathrm{V}$

9:        compute structural entropy centrality $S_i$

10:      compute mutual power $M{I}_i$

11:      compute overall importance $K_i$

12:  End for

13:  rank nodes based on key values

End algorithm