Hi,
I ran PageRank on my graph, and now I need to get the top-k highest scored.
Is there any faster / more straightforward way of achieving this than by
creating and then sorting a new dictionary, as in the following method?
def top_k_page_rank(g, pagerank_prop, k):
pr_sorted_scores = sort_pa
Hi,
I am trying to set a property (my_prop) for all the edges of a graph, where
the property values for all edges are stored in an array A.
My plan is to use my_prop.get_array()[:] = A.
Now, in what order do the values need to be in A to make sure each value
goes to the correct edge? In other wor
Hi,
I am still fighting with the same problem:
Ioana K-Hulpus wrote
> I am trying to compute a weight for each relation, that I call
> "Exclusivity".
> Given that the graph has typed edges (with the type of edges stored as an
> int in the property map label_id), the Exc
