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