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