Download data/cycle/graph_description/easy/graph104.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/graph104.txt
- Command line
-
hf download hf://datasets/Yanbin99/GITQA-Base-Legacy/data/cycle/graph_description/easy/graph104.txt
-
curl -L -o graph104.txt https://huggingface.co/datasets/Yanbin99/GITQA-Base-Legacy/resolve/main/data/cycle/graph_description/easy/graph104.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: (3,5) (3,4) (6,7) (7,3) (0,3) (0,8) (9,6) (2,3) (1,9). |