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 Exclusivity of an edge is computed as
1 / (number of all edges of same type outgoing from the source node + number
of all edges of the same type incoming to the same target node - 1) . 

I understand your suggestions, but regarding the second point, of not
looking up the edge descriptors with g.edge(edge[0], edge[1]), how else can
that be achieved? As far as I understand, g.get_edges() will return the
value of the property map for each edge, but how can I set the property map
values? 

Thanks a lot,
Ioana



--
Sent from: 
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/
_______________________________________________
graph-tool mailing list
[email protected]
https://lists.skewed.de/mailman/listinfo/graph-tool

Reply via email to