Datasets:

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