How are Gcop and Gref input when using Siminet?

[clearlove0615]

Dear professor： I noticed that: Substitution cost = Euclidean distance between Gcmp node and Gref node. But how to calculate the Euclidean distance between the two network nodes？It seems that this is impossible if use an adjacency matrix or a list of connections as the input to the network. Looking forward to your response，Thank you!

[Electrum9]

Hi there! Several things to note, about this repository and the code in general:

• This is not associated with the creators of the original Siminet algorithm. This is an implementation I made, with some modifications, for another paper which derives from Siminet.

• The graph that you pass in is expected to have a "position" attribute for each node (this is for a networkx graph), which is either a tuple or numpy array (I think it's the latter) containing the position of the node in space.

• I am not a professor, but I work in a research lab.