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