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