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