-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_cases.txt
74 lines (63 loc) · 1.46 KB
/
test_cases.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// Test Case 1:----------------------
int n=17;
int m=50;
int vertex_pointers[18];
int edges[50]={1,2,0,2,5,0,1,3,5,4,2,12,11,2,5,1,2,4,6,7,7,5,5,6,8,10,7,10,10,7,8,9,12,3,13,3,11,13,14,11,12,14,15,13,12,16,14,16,14,15};
vertex_pointers[0]=0;
vertex_pointers[1]=2;
vertex_pointers[2]=5;
vertex_pointers[3]=10;
vertex_pointers[4]=13;
vertex_pointers[5]=15;
vertex_pointers[6]=20;
vertex_pointers[7]=22;
vertex_pointers[8]=26;
vertex_pointers[9]=28;
vertex_pointers[10]=29;
vertex_pointers[11]=32;
vertex_pointers[12]=35;
vertex_pointers[13]=39;
vertex_pointers[14]=42;
vertex_pointers[15]=46;
vertex_pointers[16]=48;
vertex_pointers[17]=50;
// --------------------
Expected Output in any order:
1-0 -1
1-2 -1
2-0 -1
3-2 3
4-2 -1
4-5 -1
5-1 -1
5-2 -1
6-7 6
6-5 6
7-5 6
8-7 8
8-10 8
9-10 9
10-7 8
11-12 11
11-3 11
12-3 11
13-11 11
13-12 11
13-14 11
14-12 11
15-14 15
15-16 15
16-14 15
_____________________________________________________________
Test Case 2:
int n=7;
int m=20;
int vertex_pointers[8] = {0,1,7,9,12,15,18,20};
int edges[20]={1,0,2,3,4,5,6,1,3,1,2,4,1,3,5,1,4,6,1,5};
_____________________________________________________________
Test Case 3:
int n=22;
int m=54;
int vertex_pointers[23] = {0,2,3,5,8,11,13,16,18,20,25,27,29,31,33,36,40,42,44,46,50,52,54};
int edges[54]={2,7,19,0,3,2,4,5,3,6,7,3,6,4,5,8,0,4,6,9,8,10,13,14,19,9,11,10,12,11,13,9,12,9,15,18,14,16,17,18,15,17,16,15,14,15,1,9,20,21,19,21,19,20};
_____________________________________________________________