Re: [igraph] Data structure of network

[Wang Bing]

As the data you shown, each row should be the neighboring nodes. The node index starts from 0.

for example:  for node 0: it has neighbors: 1  2  3  4  5  6  7  8 10 11 12 13 17 19 21 31.

Best Wishes,
Bing



Researcher
FIRST, Aihara Innovative Mathematical Modelling Project, JST,
4-6-1 Komaba, Meguro-ku, Tokyo 153-8505, Japan
E-mail: address@hidden

On Wed, Apr 10, 2013 at 9:32 AM, Zhige Xin <address@hidden> wrote:

Hi dear all,

Could someone tell me what the data structure of network in the following code? Or 

how can I visit any node in this network?  

import igraph as nx

net_path = "/home/username/Documents/karate.gml"

network = nx.read(net_path)

print network

BTW, after I print it out, it shows: 

IGRAPH U--- 34 78 --

+ attr: id (v)

+ edges:

 0 --  1  2  3  4  5  6  7  8 10 11 12 13 17 19 21 31

 1 --  0  2  3  7 13 17 19 21 30

 2 --  0  1  3  7  8  9 13 27 28 32

 3 --  0  1  2  7 12 13

 4 --  0  6 10

 5 --  0  6 10 16

 6 --  0  4  5 16

 7 --  0  1  2  3

 8 --  0  2 30 32 33

 9 --  2 33

10 --  0  4  5

11 --  0

12 --  0  3

13 --  0  1  2  3 33

14 -- 32 33

15 -- 32 33

16 --  5  6

17 --  0  1

18 -- 32 33

19 --  0  1 33

20 -- 32 33

21 --  0  1

22 -- 32 33

23 -- 25 27 29 32 33

24 -- 25 27 31

25 -- 23 24 31

26 -- 29 33

27 --  2 23 24 33

28 --  2 31 33

29 -- 23 26 32 33

30 --  1  8 32 33

31 --  0 24 25 28 32 33

32 --  2  8 14 15 18 20 22 23 29 30 31 33

33 --  8  9 13 14 15 18 19 20 22 23 26 27 28 29 30 31 32

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