function [E,p,Paths,Cuts,G]=data(type)
% various network examples
switch type
    case 1 % east Wong Inria

E=[0	20	0.9
1	2	0.9
1	100	0.9
2	3	0.9
2	12	0.9
2	102	0.9
3	4	0.9
4	5	0.9
5	6	0.9
6	7	0.9
7	8	0.9
7	17	0.9
8	9	0.9
9	19	0.9
10	11	0.9
10	20	0.9
10	100	0.9
11	12	0.9
12	13	0.9
13	14	0.9
13	23	0.9
14	15	0.9
15	16	0.9
16	17	0.9
17	18	0.9
18	19	0.9
18	28	0.9
19	29	0.9
19	103	0.9
20	21	0.9
20	30	0.9
21	22	0.9
22	23	0.9
22	32	0.9
23	24	0.9
24	25	0.9
25	26	0.9
26	27	0.9
27	28	0.9
27	37	0.9
28	29	0.9
29	39	0.9
30	31	0.9
30	40	0.9
31	32	0.9
32	33	0.9
33	34	0.9
34	35	0.9
34	44	0.9
35	36	0.9
36	37	0.9
37	38	0.9
38	39	0.9
39	49	0.9
40	41	0.9
40	50	0.9
40	101	0.9
41	42	0.9
42	43	0.9
43	44	0.9
43	53	0.9
44	45	0.9
45	46	0.9
46	47	0.9
47	48	0.9
47	57	0.9
48	49	0.9
49	59	0.9
50	51	0.9
50	60	0.9
51	52	0.9
52	53	0.9
53	54	0.9
54	55	0.9
55	56	0.9
56	57	0.9
56	66	0.9
57	58	0.9
58	59	0.9
59	69	0.9
60	61	0.9
60	70	0.9
61	62	0.9
62	63	0.9
63	64	0.9
64	65	0.9
65	66	0.9
66	67	0.9
67	68	0.9
67	77	0.9
68	69	0.9
69	79	0.9
70	71	0.9
70	80	0.9
71	72	0.9
72	73	0.9
73	74	0.9
74	75	0.9
74	84	0.9
75	76	0.9
76	77	0.9
77	78	0.9
78	79	0.9
79	89	0.9
80	81	0.9
80	90	0.9
81	82	0.9
82	83	0.9
82	92	0.9
83	84	0.9
84	85	0.9
85	86	0.9
86	87	0.9
87	88	0.9
88	89	0.9
88	104	0.9
89	99	0.9
90	91	0.9
91	92	0.9
92	93	0.9
92	98	0.9
93	94	0.9
94	95	0.9
95	96	0.9
96	97	0.9
97	104	0.9
99	104	0.9];

p=E(:,3);
E=E(:,1:2)+1;
    case 2    %dodecahedron Hui 2003
backup=.99;
bone=0.999;
        
        E=[1,2,bone
    1,3,backup
    1,4,bone
    2,5,backup
    2,6,bone
    3,7,bone
    3,8,bone
    4,9,backup
    4,10,backup
    5,10,bone
    5,11,bone
    6,7,bone
    6,12,bone
    7,13,bone
    8,9,bone
    8,14,bone
    9,15,bone
    10,16,bone
    11,12,bone
    11,17,bone
    12,18,bone
    13,14,backup
    13,18,backup
    14,19,backup
    15,16,backup
    15,19,bone
    16,17,backup
    17,20,bone
    18,20,backup
    19,20,backup];

p=E(:,3);
E=E(:,1:2);


Paths(1,:)=[1,4,11,20,28];
Paths(2,:)=[3,8,17,26,30];
Paths(3,:)=[2,6,14,23,29];  % disjoint paths, but not necessarily  cuts!
%Paths(4,:)=[2,7,16,24,30];
%Paths(5,:)=[3,9,18,27,28];
%Paths(6,:)=[1,5,13,21,29];
Cuts(1,:)=[28,29,30];
Cuts(2,:)=[1,2,3];



    case 3  %Gerardo topology
E=[ 1,2,0.999
    1,3,0.999
    1,4,0.999
    2,5,0.999
    2,6,0.999
    3,7,0.999
    4,7,0.999
    5,8,0.999
    6,8,0.999
    7,9,0.999
    7,10,0.999
    7,11,0.999
    8,9,0.999
    9,13,0.999
    10,14,0.999
    11,12,0.999
    12,14,0.999
    13,14,0.999];

p=E(:,3);
E=E(:,1:2);

Paths(1,:)=[1,4, 8,13,14,18];
Paths(2,:)=[2,6,12,16,17,17];
%Paths(3,:)=[3,7,11,15,15,15];  % disjoint paths, but not necessarily  cuts!

Cuts(1,:)=[1,2,3];
Cuts(2,:)=[15,17,18];
Cuts(3,:)=[7,6,13];
Cuts(4,:)=[11,12,14];


    case 4 % INRIA diamond example
E=[0	1	0.99
0	2	0.99
1	2	0.99
1	3	0.99
2	3	0.99
4	5	0.99
4	6	0.99
5	6	0.99
5	7	0.99
6	7	0.99
8	9	0.99
8	10	0.99
9	10	0.99
9	11	0.99
10	11	0.99
0	4	0.99
0	8	0.99
3	7	0.99
3	11	0.99];

p=E(:,3);
E=E(:,1:2)+1;

    case 5 
        % here put Dirk's example grid
        
        E=[ 1,2;
            1,12
            2,11
            2,3
            3,10
            3,4
            4 9
            4 5
            5 8
            5 6
            6 7
            7 8
            7 18
            8 9
            8 17
            9 10
            9 16
            10 11
            10 15
            11 12
            11 14
            12 13
            13 14
            13 24
            14 15
            14 23
            15 16
            15 22
            16 17
            16 21
            17 18
            17 20
            18 19
            19 20
            19 30
            20 21
            20 29
            21 22
            21 28
            22 23
            22 27
            23 24
            23 26
            24 25
            25 26
            25 36
            26 27
            26 35
            27 28
            27 34
            28 29
            28 33
            29 30
            29 32
            30 31
            31 32
            32 33
            33 34
            34 35
            35 36];
        
        
        Cuts=[1,2;
              46,60;
              55,56;
              11,10;];
             % 3,4,20,22;
             % 8,9,12,13;
             % 35,53,54,57;
             % 44,45,48,59];
          
          Paths=[2,22,24,44,46     1, 4,6,8, 10    11,13,33,35,55;
                 2,22,24,44,46     1, 4,6,8, 10    56,57,58,59,60;
                 1, 4,6,8, 10     11,13,33,35,55   56,57,58,59,60;
                 2,22,24,44,46    11,13,33,35,55   56,57,58,59,60];
             
             
 p=ones(60,1)*(1-10^(-6));
 
    case 6
        % here put complete topology example
n=8;m=(n-1)*n/2; E=[];
        for i=1:n
            for j=i+1:n
        E=[E;i,j];
            end
        end
        
        p=ones(m,1)*(1-0.055); 
        
        Cuts=[1:n-1;];
              %1,n:(2*(n-1)-1);
              %2,n ,2*(n-1):(3*(n-1)-3);
              %3,n+1,2*(n-1),(3*(n-1)-2):(4*(n-1)-6)];
        Paths=[];
        

end


































global G
m=size(E,1);      % number of edges
n=max(E(:));
G = sparse(n,n);
for i=1:m
    G(E(i,1),E(i,2))=1;       
end
G=G';
