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