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