Datasets:

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