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