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