Datasets:

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