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