instruction
stringlengths 48
114
| answer
stringlengths 1
28
|
|---|---|
Graph: E->F, A->B, D->E, C->D, F->G, G->A, B->C; Query: Path from D to B | D->E->F->G->A->B |
Graph: C->D, D->E, F->G, A->B, G->H, E->F, B->C, C->F; Query: Path from H to H | H |
Graph: B->C, A->B, A->C; Query: Path from B to C | B->C |
Graph: A->B, A->D, D->E, E->C, B->C, C->D; Query: Path from B to A | No path exists |
Graph: E->F, G->A, D->B, B->C, A->B, F->G, A->C, C->D, D->E, H->F, G->H, H->I; Query: Path from A to H | A->C->D->E->F->G->H |
Graph: A->B, F->G, D->G, E->F, D->E, D->B, B->C, C->D; Query: Path from A to F | A->B->C->D->E->F |
Graph: F->G, C->E, B->C, C->D, D->E, E->F, D->A, A->B; Query: Path from F to A | No path exists |
Graph: B->C, A->B, B->C; Query: Path from A to C | A->B->C |
Graph: B->C, E->F, A->B, D->E, A->E, C->D, F->G; Query: Path from E to F | E->F |
Graph: B->C, F->G, A->B, H->I, A->D, G->H, C->D, D->E, E->F; Query: Path from F to I | F->G->H->I |
Graph: A->B, D->E, B->C, D->E, D->E, C->D; Query: Path from D to D | D |
Graph: A->B, B->C, B->D, C->D; Query: Path from B to A | No path exists |
Graph: B->D, A->B, D->E, D->B, B->C, C->D; Query: Path from D to B | D->B |
Graph: G->H, A->B, F->G, E->F, D->E, H->D, E->D, C->D, B->C; Query: Path from A to D | A->B->C->D |
Graph: C->D, A->B, B->C, B->A; Query: Path from A to B | A->B |
Graph: B->C, C->A, A->B; Query: Path from A to C | A->B->C |
Graph: G->H, B->C, A->D, C->D, E->G, H->G, D->E, E->F, A->B, C->B, F->G, H->I; Query: Path from H to A | No path exists |
Graph: F->C, A->B, C->D, B->C, E->F, B->C, D->E; Query: Path from F to C | F->C |
Graph: C->B, A->B, B->C; Query: Path from C to A | No path exists |
Graph: A->B, B->A, B->C, A->D, C->D; Query: Path from D to A | No path exists |
Graph: B->C, A->B, A->C, C->D; Query: Path from A to B | A->B |
Graph: A->B, C->D, C->D, B->C; Query: Path from C to C | C |
Graph: D->E, D->A, E->F, D->B, B->C, A->B, F->G, C->D; Query: Path from D to F | D->E->F |
Graph: E->F, B->C, F->G, D->E, C->D, I->J, H->I, F->A, G->H, F->B, A->B, H->B; Query: Path from B to J | B->C->D->E->F->G->H->I->J |
Graph: E->F, B->C, A->B, F->G, C->D, B->E, D->E; Query: Path from C to B | No path exists |
Graph: G->H, J->E, B->C, H->I, E->G, D->E, E->F, I->B, F->G, A->B, I->J, C->D, G->A, D->J; Query: Path from J to F | J->E->F |
Graph: A->B, D->E, C->D, B->C, E->F, D->C; Query: Path from F to C | No path exists |
Graph: C->D, F->B, A->B, F->C, D->E, B->C, C->E, E->F; Query: Path from A to D | A->B->C->D |
Graph: D->A, E->F, D->E, A->B, E->A, C->D, B->C; Query: Path from F to E | No path exists |
Graph: E->F, D->E, B->C, H->I, F->G, G->I, C->D, I->G, A->B, B->F, B->E, G->H; Query: Path from F to D | No path exists |
Graph: B->C, A->C, D->E, F->G, C->D, C->A, E->F, G->H, A->B, A->G; Query: Path from H to E | No path exists |
Graph: B->C, E->F, D->E, B->D, B->A, C->D, A->B; Query: Path from C to D | C->D |
Graph: C->D, B->C, A->B, D->A, D->E, E->F; Query: Path from F to C | No path exists |
Graph: B->C, E->F, E->B, C->D, A->B, D->E; Query: Path from F to C | No path exists |
Graph: C->D, B->A, B->C, A->B; Query: Path from A to C | A->B->C |
Graph: C->D, B->C, A->B, B->C, A->D; Query: Path from D to A | No path exists |
Graph: B->A, B->A, B->C, A->B, C->D; Query: Path from C to A | No path exists |
Graph: G->H, F->G, E->F, B->C, A->C, C->D, A->B, D->E; Query: Path from H to G | No path exists |
Graph: G->H, F->G, E->F, E->A, C->D, B->C, D->E, G->A, A->B; Query: Path from B to H | B->C->D->E->F->G->H |
Graph: E->F, E->B, C->D, B->C, D->E, A->B; Query: Path from E to F | E->F |
Graph: B->C, C->A, C->D, A->B, A->B; Query: Path from B to A | B->C->A |
Graph: C->D, A->B, C->B, B->C, D->E; Query: Path from C to C | C |
Graph: B->C, A->B, C->B; Query: Path from A to B | A->B |
Graph: C->D, A->B, D->B, B->C, E->B, D->E; Query: Path from C to B | C->D->E->B |
Graph: A->B, A->B, B->A, C->D, B->C; Query: Path from B to A | B->A |
Graph: A->B, D->F, F->G, E->F, E->F, G->H, C->D, C->F, F->G, D->E, B->C; Query: Path from D to F | D->E->F |
Graph: E->F, D->F, C->D, D->E, A->B, B->C; Query: Path from B to F | B->C->D->E->F |
Graph: B->C, F->B, A->B, G->H, D->E, E->F, C->D, I->J, H->I, E->F, G->F, J->C, F->G; Query: Path from J to H | J->C->D->E->F->G->H |
Graph: C->A, F->G, C->D, A->B, H->I, D->E, E->F, B->C, G->H; Query: Path from I to D | No path exists |
Graph: G->H, B->C, F->G, E->F, D->E, A->B, D->B, C->D, H->I; Query: Path from C to F | C->D->E->F |
Graph: A->B, D->E, D->E, E->F, C->D, F->G, F->G, B->C, F->E; Query: Path from A to C | A->B->C |
Graph: B->C, B->C, A->B; Query: Path from A to B | A->B |
Graph: A->D, C->D, B->C, A->B, B->A; Query: Path from C to B | No path exists |
Graph: B->C, F->G, G->H, D->F, E->F, F->C, C->D, A->B, D->E, C->H; Query: Path from H to E | No path exists |
Graph: A->C, B->C, A->B; Query: Path from B to B | B |
Graph: F->I, H->I, D->B, H->F, A->B, F->G, G->H, D->I, E->F, C->D, D->E, F->B, I->J, B->C; Query: Path from H to J | H->F->B->C->D->I->J |
Graph: B->C, C->A, C->D, A->B; Query: Path from A to A | A |
Graph: B->C, A->B, G->H, C->D, H->I, D->E, F->G, D->H, E->D, E->F, C->G; Query: Path from H to G | No path exists |
Graph: J->C, I->J, E->F, H->I, A->B, C->D, G->H, F->G, D->E, I->F, B->C, C->I; Query: Path from G to I | G->H->I |
Graph: B->C, D->C, C->D, A->B, A->B; Query: Path from D to A | No path exists |
Graph: D->E, A->B, B->D, B->C, C->D; Query: Path from D to A | No path exists |
Graph: A->B, C->D, C->B, B->C, D->C; Query: Path from C to C | C |
Graph: B->C, B->E, C->D, D->E, A->B; Query: Path from A to D | A->B->C->D |
Graph: D->E, E->F, A->B, A->D, B->C, C->D; Query: Path from B to C | B->C |
Graph: A->D, D->E, F->G, C->D, A->B, E->F, B->C; Query: Path from G to D | No path exists |
Graph: H->I, D->E, B->C, E->F, A->B, G->H, E->H, H->G, C->D, F->G; Query: Path from H to H | H |
Graph: C->D, F->G, D->E, B->C, G->H, E->F, A->B, A->B; Query: Path from E to D | No path exists |
Graph: C->A, B->C, A->B; Query: Path from C to B | C->A->B |
Graph: A->B, B->C, C->D, C->A; Query: Path from B to B | B |
Graph: D->C, C->D, D->C, B->C, A->B; Query: Path from A to D | A->B->C->D |
Graph: E->F, D->E, F->G, G->H, I->J, H->I, F->A, B->C, C->D, H->G, A->B; Query: Path from A to D | A->B->C->D |
Graph: D->F, C->D, A->B, B->C, D->E, D->B, E->F, D->E; Query: Path from F to A | No path exists |
Graph: B->D, B->C, E->F, F->G, A->B, D->E, C->D; Query: Path from F to B | No path exists |
Graph: C->D, A->C, B->C, A->B, A->B; Query: Path from A to D | A->B->C->D |
Graph: G->H, E->F, J->E, H->I, C->D, B->G, F->G, B->C, B->G, D->E, A->B, I->J; Query: Path from H to E | H->I->J->E |
Graph: C->D, F->G, A->B, D->E, G->H, E->C, B->C, E->F, E->D, G->F, F->E; Query: Path from F to A | No path exists |
Graph: B->C, A->B, C->D, C->B; Query: Path from D to B | No path exists |
Graph: A->B, C->D, F->B, D->E, B->C, E->F; Query: Path from E to E | E |
Graph: C->E, A->E, F->G, H->I, B->C, D->E, C->D, C->I, A->B, E->F, G->H; Query: Path from C to I | C->I |
Graph: A->B, D->B, D->E, E->F, B->C, C->D; Query: Path from E to C | No path exists |
Graph: B->C, D->E, E->F, A->B, C->F, B->H, F->G, G->H, C->D, C->H; Query: Path from E to E | E |
Graph: E->B, B->C, H->I, D->E, C->D, A->B, F->G, G->H, E->F, I->C; Query: Path from D to A | No path exists |
Graph: A->B, G->H, D->E, H->I, E->F, B->C, F->G, C->D, E->G, D->E; Query: Path from I to G | No path exists |
Graph: F->G, B->G, A->D, C->D, D->E, E->F, A->B, B->C, G->F, G->H, E->F, H->I; Query: Path from D to D | D |
Graph: D->E, F->G, G->H, B->A, B->C, E->F, C->D, E->G, A->B; Query: Path from A to F | A->B->C->D->E->F |
Graph: A->B, F->E, E->F, D->E, B->C, C->F, C->D; Query: Path from F to E | F->E |
Graph: B->C, C->D, F->G, B->F, D->E, E->F, A->B; Query: Path from G to E | No path exists |
Graph: B->C, E->F, F->D, D->E, D->A, C->A, A->B, C->D; Query: Path from B to B | B |
Graph: C->D, B->C, D->E, A->B, C->D; Query: Path from B to A | No path exists |
Graph: A->B, E->F, D->E, B->C, C->D, B->E; Query: Path from C to E | C->D->E |
Graph: E->F, D->E, E->A, C->D, B->C, A->B, A->B; Query: Path from C to E | C->D->E |
Graph: C->G, G->H, A->B, A->G, E->F, D->E, H->I, C->D, B->C, F->G, G->E; Query: Path from B to B | B |
Graph: B->C, E->F, D->E, F->G, F->B, A->B, C->D; Query: Path from G to E | No path exists |
Graph: D->E, G->H, B->C, A->B, F->G, C->D, E->F, F->H; Query: Path from H to H | H |
Graph: C->D, E->H, E->F, I->J, E->F, B->C, J->I, A->D, G->H, H->I, F->G, A->B, D->E, G->D; Query: Path from I to I | I |
Graph: B->C, C->D, A->B, C->D, D->E; Query: Path from C to A | No path exists |
Graph: C->B, A->B, D->E, C->D, B->C; Query: Path from C to A | No path exists |
Graph: C->A, B->C, A->B; Query: Path from B to A | B->C->A |
Graph: D->B, A->B, B->C, C->D, A->D; Query: Path from C to B | C->D->B |
Graph: C->D, A->B, B->C, C->D, C->B; Query: Path from D 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.