[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## [igraph] Reading a graph from file and counting graph edges

**From**: |
R N |

**Subject**: |
[igraph] Reading a graph from file and counting graph edges |

**Date**: |
Fri, 16 Sep 2011 17:48:33 +0300 |

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.

**[igraph] Reading a graph from file and counting graph edges**,
*R N* **<=**