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