Re: [igraph] Reading a graph from file and counting graph edges

[Gábor Csárdi]

On Fri, Sep 16, 2011 at 10:48 AM, R N <address@hidden> wrote:
> Hi all,
>
> This is a very simple question, but somehow I couldn't find any mention of it:
> when reading a graph from file (e.g., GraphML), for connected vertices u and 
> v,
> should there be entries in the file for both edges (u,v) and (v,u), or
> is it sufficient
> to include only one of them (say, (u,v)), and the other one (v,u) is
> automagically
> assumed? I mean weighted undirected graphs.

One of them is enough if you have a simple undirected graph. If you
have both of them, then igraph will create a multi-graph.

G.

>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI