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