Datasets:

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