Download data/cycle/graph_description/easy/graph106.txt from Yanbin99/GITQA-Base-Legacy: direct link, hf CLI and curl.
- Browser
- Download file 207 Bytes
-
https://huggingface.co/datasets/Yanbin99/GITQA-Base-Legacy/resolve/main/data/cycle/graph_description/easy/graph106.txt
- Command line
-
hf download hf://datasets/Yanbin99/GITQA-Base-Legacy/data/cycle/graph_description/easy/graph106.txt
-
curl -L -o graph106.txt https://huggingface.co/datasets/Yanbin99/GITQA-Base-Legacy/resolve/main/data/cycle/graph_description/easy/graph106.txt
207 Bytes
| 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). |