In the paper:Asymmetric Transitivity Preserving Graph Embedding,the authors state that they will not calculate S in this part
so that in this algorithm, they do not explicitly perform the polynomial operation on adjacency matrix in Ml and Mg, but in the implementation the S matrix is calculated fully as this shows,
I can't understand it so anyone please could explain this to me
In the paper:Asymmetric Transitivity Preserving Graph Embedding,the authors state that they will not calculate S in this part
so that in this algorithm, they do not explicitly perform the polynomial operation on adjacency matrix in Ml and Mg, but in the implementation the S matrix is calculated fully as this shows,
![Screen Shot 2024-06-02 at 7 57 38 PM](https://github.com/benedekrozemberczki/karateclub/assets/44555496/8c0da38f-4354-423e-a1d7-0ff0954be14a)
I can't understand it so anyone please could explain this to me