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