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