dgraph.test.samplegraph50 source code

1 // Written in the D programming language.
2 
3 module dgraph.test.samplegraph50;
4 
5 /**
6   Sample graph for use in testing.  The array represents an
7   undirected regular graph with 50 vertices, each having 4
8   neighbours.
9 
10   Each successive pair of array entries represents a single
11   undirected link.
12 */
13 immutable size_t[200] sampleGraph50 =
14   [ 0, 24,
15     0, 25,
16     0, 16,
17     0, 26,
18     1, 37,
19     1, 38,
20     1, 11,
21     1, 14,
22     2, 19,
23     2, 33,
24     2, 35,
25     2, 27,
26     3, 40,
27     3, 39,
28     3, 23,
29     3, 19,
30     4, 18,
31     4, 31,
32     4, 37,
33     4, 7,
34     5, 17,
35     5, 49,
36     5, 18,
37     5, 28,
38     6, 27,
39     6, 42,
40     6, 9,
41     6, 44,
42     7, 19,
43     7, 18,
44     7, 49,
45     8, 36,
46     8, 43,
47     8, 41,
48     8, 33,
49     9, 14,
50     9, 11,
51     9, 46,
52     10, 26,
53     10, 36,
54     10, 35,
55     10, 41,
56     11, 32,
57     11, 21,
58     12, 21,
59     12, 23,
60     12, 29,
61     12, 35,
62     13, 45,
63     13, 25,
64     13, 38,
65     13, 29,
66     14, 16,
67     14, 39,
68     15, 48,
69     15, 49,
70     15, 44,
71     15, 38,
72     16, 47,
73     16, 43,
74     17, 25,
75     17, 41,
76     17, 49,
77     18, 28,
78     19, 40,
79     20, 33,
80     20, 21,
81     20, 24,
82     20, 31,
83     21, 32,
84     22, 32,
85     22, 46,
86     22, 34,
87     22, 37,
88     23, 30,
89     23, 26,
90     24, 43,
91     24, 30,
92     25, 42,
93     26, 35,
94     27, 39,
95     27, 46,
96     28, 47,
97     28, 34,
98     29, 33,
99     29, 36,
100     30, 38,
101     30, 34,
102     31, 48,
103     31, 45,
104     32, 46,
105     34, 45,
106     36, 48,
107     37, 48,
108     39, 40,
109     40, 47,
110     41, 44,
111     42, 47,
112     42, 44,
113     43, 45
114   ];