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