Datasets:

instruction
stringlengths
48
114
answer
stringlengths
1
28
Graph: D->E, E->D, A->B, E->F, D->B, B->C, E->B, C->D; Query: Path from E to B
E->B
Graph: C->D, A->B, A->C, B->C; Query: Path from B to D
B->C->D
Graph: A->B, C->B, B->C; Query: Path from A to B
A->B
Graph: B->C, C->D, C->D, D->E, F->G, G->H, B->F, H->G, A->B, H->F, E->F; Query: Path from B to H
B->F->G->H
Graph: A->C, A->B, B->C; Query: Path from B to A
No path exists
Graph: B->C, C->D, D->E, E->D, A->B, E->B; Query: Path from B to D
B->C->D
Graph: E->F, F->G, D->E, A->B, C->D, F->A, B->C, E->C; Query: Path from A to E
A->B->C->D->E
Graph: C->D, D->E, G->E, E->F, F->G, B->C, C->D, F->G, A->B; Query: Path from G to F
G->E->F
Graph: B->C, A->B, B->A; Query: Path from A to B
A->B
Graph: B->C, E->F, F->C, C->F, C->D, D->A, A->B, D->E; Query: Path from D to C
D->E->F->C
Graph: G->F, G->H, H->I, D->E, F->D, E->F, F->G, A->B, C->D, B->C; Query: Path from G to H
G->H
Graph: B->C, A->B, C->D, C->D, B->D, D->E; Query: Path from D to A
No path exists
Graph: H->I, B->C, F->G, C->F, A->B, F->E, E->F, D->E, F->B, G->H, C->D, D->C; Query: Path from A to F
A->B->C->D->E->F
Graph: I->J, E->F, D->E, G->J, A->B, B->C, F->G, C->D, G->H, H->I, C->I; Query: Path from B to B
B
Graph: F->G, F->E, I->J, G->H, I->D, A->C, E->F, B->C, D->E, I->G, A->B, C->D, H->I; Query: Path from G to A
No path exists
Graph: B->C, C->A, A->B; Query: Path from A to C
A->B->C
Graph: C->A, A->B, B->C; Query: Path from A to B
A->B
Graph: B->C, A->B, B->C; Query: Path from C to B
No path exists
Graph: D->E, B->C, A->B, C->D, A->C; Query: Path from C to A
No path exists
Graph: H->B, G->H, B->C, H->I, A->B, C->D, I->J, A->J, I->B, E->F, F->G, I->C, C->H, D->E; Query: Path from I to C
I->C
Graph: C->D, H->I, D->G, F->H, G->H, A->B, E->G, I->J, D->E, E->F, G->J, A->I, F->G, B->C; Query: Path from B to D
B->C->D
Graph: C->D, A->B, A->C, B->C; Query: Path from C to B
No path exists
Graph: C->D, A->E, D->E, B->C, D->C, A->B; Query: Path from B to C
B->C
Graph: H->F, D->E, D->B, C->D, E->F, B->H, F->G, G->H, B->C, G->H, A->B; Query: Path from F to G
F->G
Graph: A->F, D->E, D->C, E->F, C->D, B->C, D->E, A->B; Query: Path from D to F
D->E->F
Graph: D->E, F->G, A->B, E->F, E->F, B->D, C->D, B->C; Query: Path from C to E
C->D->E
Graph: C->D, A->B, A->B, B->C; Query: Path from D to A
No path exists
Graph: C->D, B->C, A->B, D->E, B->C; Query: Path from C to C
C
Graph: E->F, D->E, A->B, C->D, E->C, B->C, A->F; Query: Path from B to C
B->C
Graph: B->C, C->A, A->B; Query: Path from B to C
B->C
Graph: E->F, B->C, I->J, G->H, A->C, F->G, D->E, C->D, A->G, G->A, H->I, A->B, G->C; Query: Path from B to C
B->C
Graph: E->F, C->D, H->I, A->G, F->G, D->E, B->C, A->B, G->H, E->B; Query: Path from A to A
A
Graph: D->E, A->B, E->G, H->I, B->C, F->G, B->D, G->H, E->F, C->D, F->B, C->E; Query: Path from H to E
No path exists
Graph: H->I, I->J, C->D, B->C, E->F, F->C, D->E, G->H, A->B, F->G; Query: Path from G to B
No path exists
Graph: B->C, A->B, B->F, D->E, F->G, C->D, E->F, E->A; Query: Path from B to E
B->C->D->E
Graph: C->D, D->E, A->B, A->D, E->A, B->C; Query: Path from A to B
A->B
Graph: B->C, A->B, B->C; Query: Path from A to A
A
Graph: A->C, A->B, B->C; Query: Path from B to B
B
Graph: D->C, C->D, B->C, A->B; Query: Path from A to A
A
Graph: B->C, A->B, B->C; Query: Path from A to C
A->B->C
Graph: B->C, G->H, F->G, E->F, D->E, E->H, C->D, A->B, H->D; Query: Path from F to C
No path exists
Graph: D->C, A->B, B->C, C->D; Query: Path from B to C
B->C
Graph: D->E, H->I, B->C, I->J, C->D, E->F, F->B, F->G, A->F, A->B, I->F, G->H; Query: Path from D to J
D->E->F->G->H->I->J
Graph: A->B, F->G, E->F, B->C, C->D, B->G, D->G, B->C, D->E; Query: Path from G to A
No path exists
Graph: E->F, B->G, A->B, H->I, F->G, G->H, D->E, I->J, B->C, C->D; Query: Path from A to C
A->B->C
Graph: C->D, E->A, B->C, E->C, D->E, A->B; Query: Path from B to A
B->C->D->E->A
Graph: D->B, C->D, B->C, B->C, A->B; Query: Path from D to C
D->B->C
Graph: E->F, B->C, D->E, F->C, C->B, C->D, A->B; Query: Path from F to F
F
Graph: B->C, A->C, A->B; Query: Path from C to C
C
Graph: C->A, A->B, C->D, B->C, A->B; Query: Path from B to C
B->C
Graph: B->A, B->C, A->B, B->A, C->D, D->E; Query: Path from D to B
No path exists
Graph: C->D, A->B, G->H, D->E, B->C, H->I, F->G, F->B, E->F, A->E; Query: Path from A to C
A->E->F->B->C
Graph: F->G, B->C, E->D, E->F, A->B, D->E, C->D, H->I, G->H; Query: Path from C to E
C->D->E
Graph: E->F, H->C, A->B, H->C, B->C, D->B, C->D, E->A, D->E, G->H, F->G; Query: Path from F to E
F->G->H->C->D->E
Graph: D->E, B->C, C->D, J->I, A->B, G->H, H->I, D->B, E->F, I->J, F->G, B->C; Query: Path from A to D
A->B->C->D
Graph: H->I, G->H, F->C, C->D, G->H, E->F, D->E, F->G, B->C, A->B; Query: Path from H to C
No path exists
Graph: D->E, C->D, G->B, B->C, F->G, A->B, E->F, D->G; Query: Path from B to A
No path exists
Graph: B->C, B->A, A->B; Query: Path from B to A
B->A
Graph: B->D, C->D, D->E, B->C, F->A, A->E, E->F, A->B; Query: Path from E to A
E->F->A
Graph: B->C, A->D, D->E, F->D, A->B, F->G, C->D, G->H, G->C, A->D, E->F; Query: Path from F to C
F->G->C
Graph: F->G, B->C, G->F, F->C, D->E, G->F, E->F, C->D, A->B; Query: Path from B to G
B->C->D->E->F->G
Graph: E->F, C->D, B->C, F->G, J->A, H->I, H->B, G->H, D->E, H->F, G->A, I->J, A->B; Query: Path from J to B
J->A->B
Graph: D->E, H->I, H->F, B->C, G->H, D->B, E->F, C->D, A->E, F->G, C->A, A->B; Query: Path from H to H
H
Graph: B->C, C->B, A->B; Query: Path from C to B
C->B
Graph: G->E, C->D, D->E, F->G, A->B, B->C, E->F, D->B, C->B; Query: Path from C to A
No path exists
Graph: G->D, B->C, C->D, E->F, E->I, A->B, F->G, H->I, G->H, D->E, D->A; Query: Path from A to H
A->B->C->D->E->F->G->H
Graph: C->B, B->C, A->B, C->D, D->E; Query: Path from E to C
No path exists
Graph: H->I, C->D, G->H, A->F, B->C, A->B, F->G, E->F, F->B, D->E; Query: Path from F to C
F->B->C
Graph: B->C, B->A, E->F, E->G, D->E, G->H, C->D, H->I, F->G, I->A, A->B; Query: Path from C to A
C->D->E->G->H->I->A
Graph: F->D, E->F, D->E, D->B, C->D, B->C, A->B, D->E; Query: Path from A to D
A->B->C->D
Graph: C->D, C->B, B->C, A->B; Query: Path from B to C
B->C
Graph: A->B, E->F, G->F, D->E, G->H, B->C, C->D, F->G; Query: Path from D to A
No path exists
Graph: B->C, D->E, F->G, A->B, E->F, H->I, C->D, F->D, A->B, G->H; Query: Path from I to C
No path exists
Graph: E->F, B->C, F->G, F->G, D->E, A->B, D->A, C->D, H->G, F->G, G->H; Query: Path from G to C
No path exists
Graph: C->D, A->B, E->F, I->J, D->E, B->C, H->I, G->H, F->G, B->I, E->J; Query: Path from J to B
No path exists
Graph: E->G, G->F, E->F, A->B, C->D, B->C, F->G, D->E; Query: Path from B to G
B->C->D->E->F->G
Graph: D->E, E->F, C->D, F->G, A->B, F->G, D->G, B->C; Query: Path from E to C
No path exists
Graph: B->A, A->B, B->C; Query: Path from A to B
A->B
Graph: C->D, A->B, B->C, A->D, B->D; Query: Path from D to D
D
Graph: E->F, C->D, F->E, B->C, D->E, G->H, B->H, H->F, A->B, F->G, H->C; Query: Path from E to E
E
Graph: F->G, I->J, B->J, E->F, H->I, G->H, B->C, D->E, A->B, C->D; Query: Path from E to J
E->F->G->H->I->J
Graph: F->G, C->D, E->I, G->H, D->E, E->F, B->C, A->B, H->I; Query: Path from A to C
A->B->C
Graph: E->A, B->C, D->G, C->D, D->E, E->F, F->G, A->B; Query: Path from F to C
No path exists
Graph: C->D, A->B, B->A, B->C; Query: Path from C to A
No path exists
Graph: B->A, F->G, H->B, D->E, A->B, G->E, E->F, G->H, H->D, B->C, C->D; Query: Path from F to B
F->G->H->B
Graph: G->H, H->I, C->D, B->A, E->F, D->E, C->I, A->B, B->C, C->E, F->G; Query: Path from D to B
No path exists
Graph: A->B, D->E, B->C, E->F, C->D, A->B; Query: Path from C to A
No path exists
Graph: C->B, B->C, A->B; Query: Path from C to B
C->B
Graph: I->J, F->G, C->D, E->F, B->C, A->C, D->H, A->B, G->H, D->E, H->I; Query: Path from G to D
No path exists
Graph: B->C, D->A, A->B, C->D, C->B, D->E; Query: Path from E to D
No path exists
Graph: A->C, B->C, D->E, A->B, C->D, B->C; Query: Path from B to D
B->C->D
Graph: A->C, A->B, B->C; Query: Path from B to B
B
Graph: A->D, C->D, D->C, B->C, A->B; Query: Path from C to D
C->D
Graph: D->E, E->C, C->D, A->B, B->C, E->F; Query: Path from A to B
A->B
Graph: F->G, A->B, G->H, D->E, C->D, B->C, D->E, E->F; Query: Path from G to C
No path exists
Graph: E->B, F->C, B->F, A->B, E->F, C->D, B->C, D->E; Query: Path from A to A
A
Graph: I->J, H->I, A->B, E->F, A->H, D->E, G->H, C->D, B->C, C->E, F->G; Query: Path from D to I
D->E->F->G->H->I
Graph: B->C, A->C, B->C, C->D, A->B; Query: Path from B to D
B->C->D
Graph: C->D, F->G, A->B, E->A, B->F, D->E, E->F, B->C; Query: Path from A to B
A->B
Graph: B->C, C->D, B->D, A->B; Query: Path from A to C
A->B->C