Datasets:

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