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