Datasets:

Modalities:
Text
Formats:
parquet
Libraries:
Datasets
pandas
instruction
stringlengths
48
114
answer
stringlengths
1
28
Graph: C->A, C->D, A->B, B->C; Query: Path from A to D
A->B->C->D
Graph: B->C, A->C, A->B; Query: Path from C to A
No path exists
Graph: H->I, H->E, D->E, A->B, C->D, A->C, B->C, E->F, F->G, G->H; Query: Path from B to F
B->C->D->E->F
Graph: B->D, A->B, D->E, C->D, A->F, F->G, G->H, E->F, H->E, B->C; Query: Path from B to A
No path exists
Graph: A->B, E->F, A->B, B->C, A->D, D->E, C->D; Query: Path from B to F
B->C->D->E->F
Graph: F->G, A->B, E->F, C->D, F->G, A->E, B->C, D->E, F->B; Query: Path from F to C
F->B->C
Graph: A->B, A->B, B->C; Query: Path from A to A
A
Graph: A->B, G->H, D->E, H->D, H->B, F->G, B->C, C->D, E->F; Query: Path from G to F
G->H->B->C->D->E->F
Graph: B->C, C->D, D->E, E->F, E->D, A->B; Query: Path from F to D
No path exists
Graph: B->C, D->C, D->C, A->B, C->D; Query: Path from C to C
C
Graph: D->A, A->B, D->A, B->C, C->D; Query: Path from C to B
C->D->A->B
Graph: E->C, C->D, B->C, B->A, A->B, D->E; Query: Path from B to A
B->A
Graph: A->B, A->E, E->F, F->D, D->E, A->F, B->C, C->D; Query: Path from B to E
B->C->D->E
Graph: C->D, D->E, E->F, F->C, C->D, B->C, A->B, D->E; Query: Path from E to E
E
Graph: E->F, B->A, D->E, B->C, B->A, C->D, A->F, A->B; Query: Path from B to E
B->C->D->E
Graph: B->D, C->D, B->C, D->E, D->B, A->B; Query: Path from D to D
D
Graph: A->B, B->C, A->B; Query: Path from A to A
A
Graph: A->B, C->D, E->F, E->D, D->E, B->C; Query: Path from B to A
No path exists
Graph: I->J, B->C, E->F, F->G, H->I, H->J, I->A, B->A, B->D, C->G, C->D, A->B, G->H, D->E; Query: Path from C to D
C->D
Graph: B->C, D->E, A->E, C->D, A->B, E->F, F->G; Query: Path from E to D
No path exists
Graph: E->A, D->E, C->D, A->B, B->C; Query: Path from B to D
B->C->D
Graph: A->C, C->D, B->C, A->B; Query: Path from C to B
No path exists
Graph: B->C, C->F, G->H, D->E, F->G, A->B, C->D, E->D, E->F; Query: Path from B to D
B->C->D
Graph: A->B, E->F, D->E, C->A, F->G, C->D, B->C; Query: Path from E to G
E->F->G
Graph: C->A, B->C, A->B; Query: Path from A to A
A
Graph: C->B, A->B, B->C, D->E, C->D, C->B; Query: Path from A to D
A->B->C->D
Graph: A->B, D->E, E->F, F->G, C->D, B->C, A->C; Query: Path from E to F
E->F
Graph: F->G, H->I, D->E, B->C, E->F, B->I, G->H, A->B, C->D; Query: Path from A to E
A->B->C->D->E
Graph: B->C, G->H, E->F, F->B, C->D, A->B, F->G, D->E; Query: Path from D to C
D->E->F->B->C
Graph: A->B, D->E, A->B, C->D, B->C, C->D; Query: Path from D to A
No path exists
Graph: G->H, E->F, B->C, I->J, F->G, C->D, H->I, D->H, A->B, F->E, D->E; Query: Path from I to G
No path exists
Graph: D->E, B->C, F->G, G->H, A->B, B->C, E->F, C->D; Query: Path from F to F
F
Graph: G->D, C->D, G->H, B->C, H->I, D->E, F->G, A->B, E->F; Query: Path from B to F
B->C->D->E->F
Graph: A->B, B->C, E->H, G->H, C->D, D->E, F->G, E->F; Query: Path from C to D
C->D
Graph: E->F, A->B, C->D, G->H, B->C, E->I, D->E, C->E, H->I, F->G, D->G, G->A; Query: Path from B to E
B->C->E
Graph: D->F, C->D, D->E, A->B, F->G, G->H, B->C, E->F; Query: Path from H to B
No path exists
Graph: I->J, J->D, F->G, G->H, G->D, E->F, A->B, H->I, C->D, D->E, G->H, B->C, C->A; Query: Path from H to I
H->I
Graph: H->D, G->H, A->B, E->G, C->D, B->C, F->G, G->H, H->B, E->F, D->E; Query: Path from D to E
D->E
Graph: E->F, A->B, B->H, F->G, G->F, G->H, C->B, B->C, D->E, C->D; Query: Path from D to G
D->E->F->G
Graph: G->H, G->H, E->F, B->C, H->I, D->E, C->D, F->G, A->B; Query: Path from E to G
E->F->G
Graph: I->J, D->E, G->F, A->B, F->G, E->F, B->C, H->I, C->D, G->H; Query: Path from B to G
B->C->D->E->F->G
Graph: A->B, C->D, B->A, D->E, B->C, C->D; Query: Path from D to C
No path exists
Graph: D->E, C->D, E->F, F->G, H->I, G->H, A->I, B->H, A->B, B->C, F->D; Query: Path from H to B
No path exists
Graph: C->D, F->C, D->E, B->C, A->B, C->B, E->F; Query: Path from E to A
No path exists
Graph: D->F, B->A, F->D, A->B, E->F, C->D, F->G, B->C, D->E; Query: Path from C to E
C->D->E
Graph: A->B, A->G, H->B, B->F, E->F, B->C, D->E, C->D, H->I, F->G, G->H; Query: Path from H to G
H->B->C->D->E->F->G
Graph: C->D, A->B, F->G, G->A, G->B, B->C, D->E, E->F; Query: Path from D to G
D->E->F->G
Graph: B->C, D->E, H->B, A->B, G->H, F->G, C->D, F->G, E->F; Query: Path from B to D
B->C->D
Graph: A->B, H->A, B->C, C->D, H->I, I->D, H->I, F->G, E->F, B->E, G->H, D->E; Query: Path from F to H
F->G->H
Graph: A->F, C->B, F->G, B->C, E->F, A->B, C->D, D->E; Query: Path from F to D
No path exists
Graph: F->G, E->C, A->B, A->B, E->G, B->C, C->D, D->E, E->F; Query: Path from C to A
No path exists
Graph: A->B, B->C, C->A; Query: Path from A to A
A
Graph: F->G, D->G, B->C, E->F, C->B, D->E, C->D, A->B; Query: Path from A to E
A->B->C->D->E
Graph: B->C, A->B, A->B; Query: Path from A to C
A->B->C
Graph: B->C, C->D, D->E, F->G, A->B, I->G, H->I, H->I, G->H, E->F; Query: Path from E to B
No path exists
Graph: D->E, C->D, B->A, A->B, B->C; Query: Path from E to D
No path exists
Graph: B->C, E->F, B->C, A->B, D->E, C->D, F->G; Query: Path from C to G
C->D->E->F->G
Graph: B->F, A->E, D->E, E->F, A->B, B->C, C->D; Query: Path from E to F
E->F
Graph: F->C, A->B, B->C, D->E, F->G, E->F, C->D, A->D; Query: Path from E to A
No path exists
Graph: G->H, B->C, A->E, E->A, D->E, F->G, E->F, H->I, C->D, A->B, B->D; Query: Path from H to B
No path exists
Graph: I->J, F->G, B->C, G->F, C->D, F->B, D->E, A->B, C->F, E->F, H->I, G->H; Query: Path from G to I
G->H->I
Graph: B->A, B->C, A->B; Query: Path from C to B
No path exists
Graph: B->C, D->E, H->I, A->B, G->H, F->G, D->E, E->F, C->D, I->J; Query: Path from C to E
C->D->E
Graph: A->C, B->C, A->B; Query: Path from A to C
A->B->C
Graph: C->E, A->B, C->D, D->E, B->C, D->E; Query: Path from D to B
No path exists
Graph: D->E, B->C, A->B, C->D, C->D; Query: Path from C to E
C->D->E
Graph: A->B, H->I, H->F, E->F, B->C, C->D, D->E, G->H, H->I, I->J, F->G; Query: Path from D to G
D->E->F->G
Graph: A->B, B->C, C->B; Query: Path from B to C
B->C
Graph: A->B, B->C, C->D, E->C, D->E, A->B; Query: Path from A to B
A->B
Graph: A->B, F->G, H->I, D->E, E->F, C->D, B->H, B->C, G->H, E->F; Query: Path from I to A
No path exists
Graph: C->D, C->A, B->C, A->B; Query: Path from A to D
A->B->C->D
Graph: D->E, A->B, B->C, A->E, C->A, C->D; Query: Path from B to E
B->C->D->E
Graph: A->B, G->H, C->D, C->I, F->G, B->C, E->F, H->I, D->E, B->G; Query: Path from H to E
No path exists
Graph: B->A, B->C, A->B; Query: Path from B to C
B->C
Graph: E->F, C->D, F->G, B->C, A->B, G->C, C->D, D->F, D->E; Query: Path from E to C
E->F->G->C
Graph: G->F, B->C, F->G, E->F, A->B, C->D, D->E; Query: Path from G to C
No path exists
Graph: D->E, E->F, B->C, E->C, F->B, A->B, C->B, C->D; Query: Path from E to C
E->C
Graph: C->E, C->D, A->B, B->C, D->E; Query: Path from E to C
No path exists
Graph: E->F, D->E, B->C, A->B, F->G, C->D, C->D; Query: Path from B to G
B->C->D->E->F->G
Graph: F->D, E->C, B->C, D->E, A->D, E->F, C->D, A->B; Query: Path from E to D
E->F->D
Graph: D->E, D->H, F->G, B->C, C->D, G->H, E->F, A->B; Query: Path from H to E
No path exists
Graph: G->H, H->I, C->D, B->C, F->G, C->A, D->E, E->F, A->B; Query: Path from G to H
G->H
Graph: G->H, H->E, E->F, G->C, C->D, B->C, B->G, C->D, D->E, F->G, A->B; Query: Path from F to A
No path exists
Graph: H->B, D->B, H->I, D->A, B->C, E->F, G->H, C->D, D->E, F->G, A->B; Query: Path from D to D
D
Graph: F->G, C->D, D->E, A->C, A->B, B->C, G->H, E->F, C->B; Query: Path from F to D
No path exists
Graph: G->H, E->F, C->D, C->H, D->E, F->G, B->C, A->B; Query: Path from H to H
H
Graph: H->E, F->G, B->C, C->D, G->H, A->B, E->F, D->E; Query: Path from A to H
A->B->C->D->E->F->G->H
Graph: A->B, G->H, B->C, C->B, H->I, B->F, D->E, F->G, B->H, H->B, E->F, C->D; Query: Path from B to B
B
Graph: B->C, A->B, C->D, E->F, D->B, D->E, D->C; Query: Path from C to D
C->D
Graph: D->E, F->B, E->F, H->A, C->D, F->G, A->B, G->H, B->G, B->C; Query: Path from F to B
F->G->H->A->B
Graph: G->H, H->I, E->F, A->B, B->C, F->B, F->G, C->D, D->E, G->A, E->I; Query: Path from B to E
B->C->D->E
Graph: E->F, B->C, D->E, E->F, C->D, E->F, A->B; Query: Path from F to C
No path exists
Graph: C->E, G->A, G->H, D->E, A->B, E->F, F->G, B->C, A->B, C->D; Query: Path from F to C
F->G->A->B->C
Graph: B->A, F->G, G->H, E->F, F->G, D->E, C->D, B->C, A->B, C->B; Query: Path from G to E
No path exists
Graph: D->A, B->C, D->E, A->B, C->D, A->C, E->F, C->E; Query: Path from E to A
No path exists
Graph: B->A, B->C, A->B; Query: Path from B to B
B
Graph: B->C, C->D, A->B, D->C; Query: Path from D to B
No path exists
Graph: E->F, C->D, B->C, F->G, G->H, G->H, D->E, A->B; Query: Path from G to G
G
Graph: A->B, F->G, D->A, D->E, E->F, B->C, C->D; Query: Path from A to D
A->B->C->D
Graph: B->C, A->B, C->D, D->C; Query: Path from D to C
D->C
README.md exists but content is empty.
Downloads last month
17