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