]]>
Daily lesson: make sure you are running the latest version of the software.
Statistics:Posted by Tatteo — 10 Nov 2017 12:14
]]>
]]>
Apologies if this question has already been asked. I have looked around, but cannot find any other instances.
I am having issues analysing a dataset. In the dataset I have some instances of multiple edges connecting the same two nodes. My problem, multiplied by a few thousand rows, is that I have something like:
A - B
B - A
A - C
C - B
What I would like to calculate is the number of neighbours that each node has.
I thought I could just calculate their degree, but this is influenced by the fact that some nodes are linked twice. So A's degree would be ranked 3 when it actually has 2 neighbours.
So my question is: is there a way to
a) rank nodes by number of neighbours instead of by degree
OR
b) merge duplicate edges with nodes in opposite order.
Thanks a lot!
Statistics:Posted by Tatteo — 08 Nov 2017 14:45
]]>