Datasets:

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