Datasets:

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