instruction stringlengths 48 114 | answer stringlengths 1 28 |
|---|---|
Graph: A->F, A->B, A->F, B->C, C->D, D->E, E->F, F->E; Query: Path from A to A | A |
Graph: A->B, F->G, C->D, I->J, C->D, D->E, E->F, G->H, B->C, E->A, H->I, D->E, J->D, A->I; Query: Path from J to H | J->D->E->F->G->H |
Graph: G->H, D->E, A->B, F->B, B->C, C->A, F->G, B->G, C->D, E->F; Query: Path from A to C | A->B->C |
Graph: D->E, I->J, F->I, C->D, F->G, E->F, B->C, H->I, G->H, A->B; Query: Path from I to F | No path exists |
Graph: F->G, E->G, B->C, D->E, C->D, C->E, E->F, F->G, A->B; Query: Path from F to E | No path exists |
Graph: B->D, G->H, F->G, C->D, G->B, A->B, E->F, B->C, C->F, D->E; Query: Path from A to C | A->B->C |
Graph: B->C, A->B, D->E, A->C, C->D; Query: Path from B to E | B->C->D->E |
Graph: C->D, A->B, B->C, B->C; Query: Path from A to A | A |
Graph: D->E, A->G, F->G, E->F, B->C, C->D, G->H, A->B; Query: Path from F to D | No path exists |
Graph: D->F, D->B, E->F, B->A, C->D, B->C, D->E, A->B; Query: Path from D to C | D->B->C |
Graph: D->E, A->B, C->D, A->B, C->D, B->C; Query: Path from D to A | No path exists |
Graph: A->B, E->F, C->D, E->A, B->C, D->E; Query: Path from C to D | C->D |
Graph: G->H, C->D, A->B, B->C, D->E, F->G, E->F, D->E; Query: Path from D to B | No path exists |
Graph: E->F, C->D, G->E, C->B, A->B, D->E, F->G, B->C, E->C; Query: Path from F to C | F->G->E->C |
Graph: F->C, C->D, A->B, D->E, B->C, E->F; Query: Path from B to B | B |
Graph: H->I, F->G, C->D, D->E, B->C, G->H, A->B, E->D, C->D, B->H, E->F; Query: Path from E to I | E->F->G->H->I |
Graph: D->E, B->C, E->F, A->B, C->D, A->D, D->B; Query: Path from B to E | B->C->D->E |
Graph: H->I, C->D, B->C, B->C, C->B, D->E, G->H, E->F, F->G, A->B, I->C; Query: Path from I to I | I |
Graph: A->B, F->G, C->F, B->C, D->E, E->F, D->E, C->D; Query: Path from E to A | No path exists |
Graph: B->C, A->B, C->D, A->B; Query: Path from C to B | No path exists |
Graph: I->C, E->F, B->C, A->B, D->E, F->I, F->C, G->H, C->D, I->J, F->G, H->I; Query: Path from C to F | C->D->E->F |
Graph: E->F, C->D, F->G, B->C, D->E, G->C, F->G, G->H, F->D, A->B; Query: Path from C to A | No path exists |
Graph: B->C, A->B, A->B; Query: Path from C to C | C |
Graph: D->E, A->B, C->D, B->C, B->C; Query: Path from B to D | B->C->D |
Graph: I->J, A->I, F->G, G->A, B->C, E->F, H->I, F->B, G->H, C->D, A->B, D->E; Query: Path from J to A | No path exists |
Graph: H->I, I->J, A->G, D->A, F->G, B->C, G->H, D->E, E->F, E->A, C->D, A->B; Query: Path from I to D | No path exists |
Graph: D->F, A->B, D->E, C->D, F->A, E->F, B->C; Query: Path from F to C | F->A->B->C |
Graph: A->B, B->C, D->E, E->D, C->D, C->D; Query: Path from D to A | No path exists |
Graph: A->B, B->A, B->C; Query: Path from A to C | A->B->C |
Graph: A->B, D->B, B->C, C->D; Query: Path from D to C | D->B->C |
Graph: A->B, B->C, C->A; Query: Path from A to A | A |
Graph: C->D, D->C, B->C, A->B; Query: Path from A to B | A->B |
Graph: G->D, A->B, B->C, F->G, B->A, D->E, E->F, C->D; Query: Path from G to F | G->D->E->F |
Graph: B->C, F->G, A->B, E->F, G->E, F->B, D->F, D->E, C->D; Query: Path from E to B | E->F->B |
Graph: B->C, B->C, A->B; Query: Path from A to C | A->B->C |
Graph: G->H, B->C, I->B, C->D, I->J, F->G, C->H, D->E, E->F, H->D, A->B, H->I, J->D; Query: Path from F to B | F->G->H->I->B |
Graph: B->C, E->C, D->E, C->D, A->B, A->B; Query: Path from C to B | No path exists |
Graph: A->B, C->D, B->C, D->C; Query: Path from D to B | No path exists |
Graph: G->C, A->B, E->F, F->G, D->E, B->C, C->D, B->C, D->B; Query: Path from G to E | G->C->D->E |
Graph: B->C, C->B, A->B; Query: Path from A to B | A->B |
Graph: F->G, A->B, C->D, G->H, B->G, F->D, D->E, E->F, B->C, D->H; Query: Path from D to H | D->H |
Graph: B->C, A->B, C->D, B->C; Query: Path from A to B | A->B |
Graph: D->I, E->F, A->B, C->D, I->J, B->C, H->I, E->G, F->G, D->E, B->G, G->H; Query: Path from A to I | A->B->G->H->I |
Graph: B->A, A->B, C->D, C->A, B->C; Query: Path from D to D | D |
Graph: C->F, C->D, C->F, F->B, E->F, A->B, D->E, B->C; Query: Path from A to C | A->B->C |
Graph: D->C, A->B, B->C, B->C, C->D; Query: Path from C to D | C->D |
Graph: C->A, B->C, D->E, H->D, F->G, E->F, A->B, C->D, D->A, G->H, B->H; Query: Path from H to B | H->D->A->B |
Graph: H->I, D->E, I->J, A->B, B->C, C->D, G->D, E->F, D->G, F->G, G->H; Query: Path from F to H | F->G->H |
Graph: B->C, D->E, C->D, G->H, E->F, B->I, A->B, F->G, H->A, H->I; Query: Path from A to F | A->B->C->D->E->F |
Graph: G->H, H->I, E->F, D->E, A->B, B->C, C->D, F->G, F->C; Query: Path from G to C | No path exists |
Graph: A->B, B->D, C->D, E->B, B->C, D->E; Query: Path from C to E | C->D->E |
Graph: A->B, F->G, E->F, I->F, I->J, G->H, C->D, B->C, H->I, D->E; Query: Path from J to H | No path exists |
Graph: A->E, B->C, E->F, D->B, D->E, B->D, C->D, A->B; Query: Path from F to E | No path exists |
Graph: D->E, I->J, G->E, E->F, F->G, C->D, H->I, G->H, A->B, B->C; Query: Path from E to J | E->F->G->H->I->J |
Graph: D->E, E->F, A->B, C->F, C->D, B->C; Query: Path from D to E | D->E |
Graph: C->A, A->B, B->C; Query: Path from A to C | A->B->C |
Graph: F->G, C->D, D->E, B->C, E->F, B->D, A->B; Query: Path from F to E | No path exists |
Graph: C->D, B->C, G->H, E->D, E->B, A->B, G->E, E->F, I->J, D->E, H->I, F->G; Query: Path from A to C | A->B->C |
Graph: E->F, A->B, D->E, E->B, F->G, G->H, C->D, B->C; Query: Path from B to D | B->C->D |
Graph: B->C, D->E, C->D, F->G, F->B, E->F, H->F, A->B, D->A, D->G, G->H; Query: Path from H to H | H |
Graph: A->B, B->C, D->A, C->D; Query: Path from A to D | A->B->C->D |
Graph: B->C, A->B, C->B; Query: Path from A to A | A |
Graph: C->D, A->B, A->C, B->C, B->D; Query: Path from C to A | No path exists |
Graph: B->C, A->B, C->B; Query: Path from A to A | A |
Graph: A->B, B->C, B->A; Query: Path from B to C | B->C |
Graph: B->C, B->A, D->E, C->B, G->D, E->F, C->D, A->B, F->G; Query: Path from D to A | No path exists |
Graph: D->E, E->A, A->B, B->C, E->F, C->D; Query: Path from F to C | No path exists |
Graph: C->D, A->B, G->H, D->E, C->E, B->C, F->G, E->F; Query: Path from D to D | D |
Graph: A->B, G->B, G->H, E->F, B->C, G->E, C->D, F->G, D->E, C->H; Query: Path from G to G | G |
Graph: A->B, D->E, H->C, B->C, G->H, C->D, E->F, F->G; Query: Path from A to G | A->B->C->D->E->F->G |
Graph: C->A, B->C, A->B; Query: Path from C to A | C->A |
Graph: C->D, F->G, D->E, A->F, E->F, B->C, G->E, A->B, C->A; Query: Path from A to D | A->B->C->D |
Graph: D->E, C->D, G->D, B->C, D->B, E->F, F->G, A->F, A->B; Query: Path from C to F | C->D->E->F |
Graph: D->E, C->D, A->B, C->A, B->C, E->F; Query: Path from E to F | E->F |
Graph: A->B, B->C, B->C; Query: Path from B to B | B |
Graph: C->D, E->F, B->C, D->E, D->A, C->D, A->B, F->G; Query: Path from F to A | No path exists |
Graph: F->G, D->J, E->F, G->H, B->J, C->D, B->C, D->E, A->B, H->I, I->J; Query: Path from E to J | E->F->G->H->I->J |
Graph: D->B, B->C, C->D, A->B; Query: Path from C to D | C->D |
Graph: B->D, A->B, B->C, C->D; Query: Path from C to B | No path exists |
Graph: C->D, E->F, E->C, A->B, D->E, B->C; Query: Path from A to A | A |
Graph: B->C, A->B, A->C; Query: Path from A to A | A |
Graph: A->C, B->C, A->B; Query: Path from A to A | A |
Graph: C->D, H->I, G->H, B->C, E->F, A->B, I->J, B->A, F->G, D->E, F->J; Query: Path from E to F | E->F |
Graph: H->D, F->G, A->B, G->H, B->C, C->D, D->E, E->F, C->G, H->C, A->B; Query: Path from A to F | A->B->C->G->H->D->E->F |
Graph: E->F, D->B, B->H, C->D, F->G, A->B, G->H, D->E, B->C, F->H; Query: Path from H to G | No path exists |
Graph: B->F, B->C, E->D, G->F, C->D, E->F, D->E, F->G, A->B; Query: Path from B to G | B->C->D->E->F->G |
Graph: E->F, C->D, A->B, D->E, B->C, F->B; Query: Path from A to B | A->B |
Graph: F->G, F->D, A->B, B->C, C->D, G->H, E->F, D->E; Query: Path from B to G | B->C->D->E->F->G |
Graph: G->H, D->E, B->C, E->F, A->B, C->D, F->G, F->C, H->I, D->H, I->J; Query: Path from J to A | No path exists |
Graph: F->G, D->E, E->F, C->D, A->B, B->E, B->C, G->H; Query: Path from F to A | No path exists |
Graph: A->E, B->F, G->H, I->E, E->F, B->C, A->B, C->D, D->E, I->D, F->G, H->I, E->B, I->J; Query: Path from I to E | I->D->E |
Graph: B->C, B->A, C->D, A->B; Query: Path from D to A | No path exists |
Graph: C->B, C->D, B->C, E->F, F->A, A->B, D->E; Query: Path from C to F | C->D->E->F |
Graph: C->D, A->B, B->C, C->D, D->E; Query: Path from D to A | No path exists |
Graph: C->D, B->C, A->B, A->D, D->E; Query: Path from B to E | B->C->D->E |
Graph: A->B, A->B, B->C; Query: Path from A to B | A->B |
Graph: F->G, A->B, D->E, I->J, G->H, E->C, H->I, B->C, C->D, D->I, E->F; Query: Path from H to D | No path exists |
Graph: C->B, A->B, B->C; Query: Path from C to B | C->B |
Graph: G->B, D->E, C->D, C->A, G->H, H->G, F->G, E->F, B->C, B->C, A->B; Query: Path from E to E | E |
Graph: A->B, G->H, H->I, C->D, D->E, B->C, E->F, B->G, F->G; Query: Path from H to F | No path exists |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.