Hi,

Is there a method to calculate the Dice or the Jaccard similarity between *all
pairs of vertices* in the graph? Similar to the similarity_dice
<http://igraph.org/python/doc/igraph.GraphBase-class.html#similarity_dice> ;
and similarity_jaccard
<http://igraph.org/python/doc/igraph.GraphBase-class.html#similarity_jaccard> ;
methods in igraph?

I searched through graph_tool documentation, and google, but did not find
anything.

Thanks,
Alexey

attachment.html (1.54 KB)

And how about similarity_inverse_log_weighted
<http://igraph.org/python/doc/igraph.GraphBase-class.html#similarity_inverse_log_weighted> ;
?

I realize that you could calculate those properties in a python script, but
I was hoping for something fast that would take advantage of all the cores
with OpenMP.

Thanks again,
Alexey

Hi,

Is there a method to calculate the Dice or the Jaccard similarity between *all
pairs of vertices* in the graph? Similar to the similarity_dice
<http://igraph.org/python/doc/igraph.GraphBase-class.html#similarity_dice> ;
and similarity_jaccard
<http://igraph.org/python/doc/igraph.GraphBase-class.html#similarity_jaccard> ;
methods in igraph?

I searched through graph_tool documentation, and google, but did not find
anything.

Thanks,
Alexey

attachment.html (5.69 KB)

tiago
(Tiago Peixoto)
March 25, 2016, 1:57am
#3
These functions are not yet implemented. If you want them, please open
an issue at the website to help track it.

Best,
Tiago

Opened an issue here: https://git.skewed.de/count0/graph-tool/issues/287 .

Thanks for all your work on graph_tool!

Alexey

attachment.html (1.77 KB)