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