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