igraph - The way of comparison between two networks via Euclidean distance

Question

I want to compare two networks(with the same nodes but different link distribution) to see how much they are close to each other.

I have found that Euclidean distance is best for undirected weighted graphs.

Can you tell me an easy way to do that in igraph?

thank you,

question from:https://stackoverflow.com/questions/65948244/the-way-of-comparison-between-two-networks-via-euclidean-distance

Answer 1

Waitting for answers