Call simplify() to sum up the edges, and then divide by the degree of the source vertex.
Gabor On Mon, May 5, 2014 at 12:18 AM, Ragia Ibrahim <[email protected]> wrote: > Dear group, > kindly how can i collapse edges on the wight sum over node degree, for > each redundant relation between two nodes. > > example if i have relation between > > node1 and node 2 weight 1 > node 1 and node 2 (again) weight 1 > node 2 and node1 weight 1 > node 2 and node 3 > > > how can i get > > > node1 node 2 weight 2/3 #number of redundant > edges/first node degree > > > node 2 and node1 weight 1/4 > > > Regards, > RAE > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
