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