Calculate nodes' degree to improve greedy method's accuracy

[hardbyte]

Issue by tho802
Wednesday Jun 22, 2016 at 05:17 GMT
Originally opened as https://github.csiro.au/magic/AnonymousLinking/issues/11

---

If we apply the threshold of similarity scores in C, and instead of returning the top K edges, we return the edges that meet the threshold (along with the count) it should be slightly quicker.

If we can also determine the degree of the nodes from organisation B we can make more accurate matches - e.g. defeating #10

Aha! Link: https://csiro.aha.io/features/ANONLINK-80