update

.gitattributes

@@ -1,4 +1,5 @@
 *.7z filter=lfs diff=lfs merge=lfs -text
+*.json filter=lfs diff=lfs merge=lfs -text
 *.arrow filter=lfs diff=lfs merge=lfs -text
 *.bin filter=lfs diff=lfs merge=lfs -text
 *.bz2 filter=lfs diff=lfs merge=lfs -text

data/connectivity/QA/Vision_Only_test.json

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4e77b1349549ad687774ac4bd04e88c492422e07c3f6c128df649af24f0b6ba6
+size 9325574

data/connectivity/QA/Vision_Only_train.json

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fe2de5d9caaa93618366bb978a3dcf18d61dc5a3b678489a7343f7e802b9fa26
+size 21753730

data/connectivity/graph_description/easy/graph0.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 4, and the edges are: (0,4) (1,4) (2,4).

data/connectivity/graph_description/easy/graph1.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 4, and the edges are: (0,2) (0,1) (3,4).

data/connectivity/graph_description/easy/graph10.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 5, and the edges are: (0,5) (0,3) (0,2) (1,5) (1,3) (2,5) (2,3) (3,5).

data/connectivity/graph_description/easy/graph100.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (7,1) (7,4) (7,2) (6,1) (9,1) (6,8) (5,4) (7,0) (3,4).

data/connectivity/graph_description/easy/graph101.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,8) (5,3) (7,2) (7,6) (7,0) (8,6) (8,4) (9,0) (5,8).

data/connectivity/graph_description/easy/graph102.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (3,9) (7,9) (4,1) (0,6) (2,8) (5,8) (9,1) (4,8) (8,6).

data/connectivity/graph_description/easy/graph103.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (8,3) (5,7) (9,7) (7,0) (7,4) (8,6) (1,8) (3,2) (9,2).

data/connectivity/graph_description/easy/graph104.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (3,5) (3,4) (6,7) (7,3) (0,3) (0,8) (9,6) (2,3) (1,9).

data/connectivity/graph_description/easy/graph105.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (5,4) (7,3) (7,8) (1,2) (1,7) (7,9) (3,6) (5,3) (2,0).

data/connectivity/graph_description/easy/graph106.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (5,8) (7,2) (1,5) (7,6) (0,1) (4,7) (2,1) (3,4) (9,2).

data/connectivity/graph_description/easy/graph107.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (8,5) (8,0) (6,5) (7,3) (1,8) (2,0) (9,8) (1,4) (6,3).

data/connectivity/graph_description/easy/graph108.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (0,1) (4,2) (2,3) (4,1) (8,2) (7,1) (9,1) (4,6) (3,5).

data/connectivity/graph_description/easy/graph109.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (2,0) (1,3) (3,6) (9,7) (2,7) (4,3) (0,8) (8,6) (9,5).

data/connectivity/graph_description/easy/graph11.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 5, and the edges are: (0,5) (0,1) (0,3) (1,5) (1,3) (2,4) (3,5).

data/connectivity/graph_description/easy/graph110.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (9,1) (7,0) (2,7) (7,4) (3,4) (7,1) (8,6) (6,1) (5,4).

data/connectivity/graph_description/easy/graph111.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (6,8) (5,7) (5,8) (5,4) (8,2) (6,1) (4,0) (3,6) (9,6).

data/connectivity/graph_description/easy/graph112.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (0,7) (3,5) (8,4) (4,0) (7,6) (6,1) (9,0) (2,0) (3,4).

data/connectivity/graph_description/easy/graph113.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (9,0) (3,1) (8,0) (2,7) (0,6) (5,8) (0,4) (3,0) (2,3).

data/connectivity/graph_description/easy/graph114.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (8,4) (1,8) (7,4) (3,6) (5,8) (2,0) (0,7) (9,3) (8,6).

data/connectivity/graph_description/easy/graph115.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,3) (0,8) (9,7) (2,0) (7,2) (3,6) (6,8) (9,5) (4,3).

data/connectivity/graph_description/easy/graph116.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (6,0) (8,9) (5,1) (8,4) (2,3) (9,6) (6,2) (5,3) (4,7).

data/connectivity/graph_description/easy/graph117.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (0,2) (4,2) (7,2) (2,9) (8,4) (2,6) (8,3) (7,1) (4,5).

data/connectivity/graph_description/easy/graph118.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,0) (3,6) (9,2) (1,4) (5,8) (9,1) (4,7) (4,8) (3,4).

data/connectivity/graph_description/easy/graph119.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (0,6) (4,8) (9,2) (8,7) (3,0) (5,7) (0,2) (5,6) (1,4).

data/connectivity/graph_description/easy/graph12.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 5, and the edges are: (0,2) (1,2) (3,5).

data/connectivity/graph_description/easy/graph120.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (9,2) (5,2) (3,9) (2,8) (5,4) (6,1) (5,1) (1,7) (7,0).

data/connectivity/graph_description/easy/graph121.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (3,6) (3,4) (0,1) (8,4) (1,4) (2,9) (8,5) (4,7) (9,1).

data/connectivity/graph_description/easy/graph122.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,4) (7,6) (8,3) (5,9) (2,8) (7,9) (6,3) (7,0) (9,1).

data/connectivity/graph_description/easy/graph123.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (6,8) (9,8) (2,0) (2,6) (4,2) (5,7) (7,1) (6,5) (7,3).

data/connectivity/graph_description/easy/graph124.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (5,3) (1,2) (6,8) (8,7) (2,9) (3,4) (4,7) (0,9) (8,2).

data/connectivity/graph_description/easy/graph125.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,4) (3,6) (4,0) (7,9) (2,5) (7,4) (3,1) (5,3) (3,8).

data/connectivity/graph_description/easy/graph126.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (3,6) (4,5) (7,5) (2,8) (6,1) (6,8) (4,0) (6,9) (5,8).

data/connectivity/graph_description/easy/graph127.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (8,9) (1,0) (3,7) (1,4) (4,8) (6,4) (2,6) (7,4) (5,3).

data/connectivity/graph_description/easy/graph128.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,5) (1,0) (9,6) (2,1) (4,7) (2,6) (2,4) (5,8) (9,3).

data/connectivity/graph_description/easy/graph129.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,9) (9,6) (5,3) (3,7) (3,2) (8,0) (4,3) (0,3) (6,7).

data/connectivity/graph_description/easy/graph13.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 5, and the edges are: (0,2) (0,4).

data/connectivity/graph_description/easy/graph130.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (5,4) (0,1) (8,9) (9,0) (4,6) (3,1) (6,8) (7,6) (2,4).

data/connectivity/graph_description/easy/graph131.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (6,8) (7,5) (7,3) (5,6) (7,1) (8,9) (6,2) (0,2) (4,2).

data/connectivity/graph_description/easy/graph132.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (2,5) (6,2) (9,2) (9,0) (7,3) (1,8) (4,5) (1,3) (7,4).

data/connectivity/graph_description/easy/graph133.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (2,4) (8,6) (5,8) (1,4) (5,1) (9,0) (3,9) (3,2) (7,1).

data/connectivity/graph_description/easy/graph134.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (7,1) (0,8) (7,5) (2,1) (0,6) (7,4) (0,3) (9,3) (2,6).

data/connectivity/graph_description/easy/graph135.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (1,0) (7,2) (7,6) (2,1) (7,4) (2,9) (4,3) (1,5) (8,5).

data/connectivity/graph_description/easy/graph136.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (2,3) (3,5) (1,9) (3,0) (3,7) (9,6) (6,7) (4,3) (0,8).

data/connectivity/graph_description/easy/graph137.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (5,4) (7,9) (4,9) (6,7) (8,5) (1,6) (2,1) (5,0) (8,3).

data/connectivity/graph_description/easy/graph138.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (4,1) (3,7) (8,0) (8,9) (8,5) (2,0) (6,3) (8,1) (5,6).

data/connectivity/graph_description/easy/graph139.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 9, and the edges are: (7,4) (7,5) (8,0) (7,8) (9,5) (2,9) (1,7) (6,3) (0,6).

data/connectivity/graph_description/easy/graph14.txt

@@ -0,0 +1,2 @@
+In an undirected graph, (i,j) means that node i and node j are connected with an undirected edge.
+The nodes are numbered from 0 to 5, and the edges are: (0,3) (1,3) (2,5).