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 On Thu, Mar 24, 2016 at 8:41 PM, Alexey Strokach <ostrokach@gmail.com> wrote: 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