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