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