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