Datasets:

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