Re: [igraph] : Simplify() use

[patricia]

I draw two vertices randomly between 0 and (number of samples -1) then put those positions in an array and then add these positions to the undirected graph.     Example: was drawn vertices 10 and 55, then I add these positions to a vector named after these vertices and edges (10 and 55) are added to the graph undirected manner (igraph_add_edges (& net, & degree, 0)).

> Date: Sat, 15 Nov 2014 23:22:48 -0500
> From: address@hidden
> To: address@hidden
> Subject: Re: [igraph] : Simplify() use
>
> [...]
> > 1) give away a pair of vertices and connect them with weights defined by the
> > similarity between the samples, which was calculated previously;
>
> What does "give away" mean? You "consider" a pair of vertices? What is
> the order of the pairs in which you consider them?
>
> G.
>
> [...]
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help