Datasets:

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