instruction stringlengths 48 114 | answer stringlengths 1 28 |
|---|---|
Graph: A->D, B->C, B->A, A->B, C->D; Query: Path from A to B | A->B |
Graph: B->C, D->E, A->E, A->B, C->D, B->A; Query: Path from A to E | A->B->C->D->E |
Graph: B->C, C->A, E->C, D->E, C->D, A->B; Query: Path from D to C | D->E->C |
Graph: E->C, C->D, E->F, F->G, B->C, G->A, A->B, C->D, D->E; Query: Path from B to C | B->C |
Graph: D->E, F->G, G->H, E->F, B->C, H->I, B->A, C->D, A->B, H->A, A->I; Query: Path from D to A | D->E->F->G->H->A |
Graph: A->H, H->B, E->F, H->I, A->B, I->J, G->F, G->H, F->G, C->D, G->B, B->C, D->E; Query: Path from I to H | No path exists |
Graph: F->G, A->B, C->D, E->F, I->J, G->H, B->C, D->E, G->E, I->A, H->I; Query: Path from C to I | C->D->E->F->G->H->I |
Graph: A->B, B->A, C->D, D->A, B->C; Query: Path from A to C | A->B->C |
Graph: B->I, C->H, C->D, G->H, B->C, F->G, G->D, E->F, H->I, D->E, C->H, A->B; Query: Path from F to C | No path exists |
Graph: B->C, B->A, D->E, C->D, D->A, A->B; Query: Path from D to C | D->A->B->C |
Graph: C->D, F->G, B->C, A->B, D->E, G->H, E->F, D->A; Query: Path from B to A | B->C->D->A |
Graph: G->H, C->D, A->B, I->E, H->I, E->F, D->E, B->C, F->G; Query: Path from G to H | G->H |
Graph: B->C, A->B, D->B, C->D, A->D; Query: Path from C to A | No path exists |
Graph: C->A, A->B, B->C; Query: Path from C to A | C->A |
Graph: E->F, G->H, H->I, F->H, I->J, B->C, D->E, B->A, D->E, A->B, C->D, J->H, F->G; Query: Path from G to A | No path exists |
Graph: F->G, G->H, D->E, A->I, B->C, I->J, E->F, A->B, C->D, J->A, H->I, I->H; Query: Path from E to A | E->F->G->H->I->J->A |
Graph: F->E, A->B, C->D, F->G, D->E, F->C, B->C, B->A, E->F; Query: Path from F to B | No path exists |
Graph: D->C, A->B, D->E, C->D, A->B, B->C; Query: Path from A to C | A->B->C |
Graph: D->E, B->C, C->D, F->A, E->F, A->B, H->I, G->H, F->G, C->D, A->D, D->A; Query: Path from E to F | E->F |
Graph: C->B, B->E, C->D, A->B, E->F, D->E, B->C, D->A; Query: Path from E to A | No path exists |
Graph: C->B, B->C, A->B; Query: Path from B to C | B->C |
Graph: B->C, E->F, H->I, F->D, D->E, I->J, A->E, E->D, I->C, F->G, G->H, I->B, A->B, C->D; Query: Path from H to C | H->I->B->C |
Graph: C->D, A->B, D->F, A->D, C->B, E->F, B->C, D->E, F->G; Query: Path from E to G | E->F->G |
Graph: D->E, B->C, C->D, E->F, E->B, C->D, A->B; Query: Path from D to A | No path exists |
Graph: A->B, E->F, C->F, D->E, C->D, B->C; Query: Path from D to F | D->E->F |
Graph: C->D, C->D, B->C, A->B, A->D; Query: Path from D to B | No path exists |
Graph: F->G, E->F, H->I, I->E, B->C, A->B, F->C, D->E, C->D, G->H, H->D; Query: Path from G to D | G->H->D |
Graph: B->C, G->D, G->H, F->G, F->C, A->B, D->E, C->D, E->F; Query: Path from E to G | E->F->G |
Graph: C->D, B->C, G->H, H->I, A->B, F->G, D->E, I->J, E->F, D->C; Query: Path from G to C | No path exists |
Graph: C->D, A->B, A->D, B->C; Query: Path from D to B | No path exists |
Graph: A->B, C->A, B->C; Query: Path from C to B | C->A->B |
Graph: D->E, B->C, A->B, H->I, F->G, C->D, I->J, G->H, D->C, E->F; Query: Path from H to D | No path exists |
Graph: E->F, G->F, I->J, D->H, G->H, H->I, C->D, H->C, F->G, B->C, D->E, A->B; Query: Path from E to J | E->F->G->H->I->J |
Graph: D->E, B->C, A->B, F->G, E->F, A->D, C->D; Query: Path from E to B | No path exists |
Graph: F->G, B->C, G->H, H->I, D->E, C->D, E->F, I->E, A->B; Query: Path from D to D | D |
Graph: H->A, G->H, E->F, A->B, C->G, H->I, F->G, C->D, B->C, D->E; Query: Path from F to D | F->G->H->A->B->C->D |
Graph: A->B, D->E, C->B, E->F, A->D, F->G, A->G, B->C, C->D; Query: Path from C to D | C->D |
Graph: B->C, H->I, D->E, F->G, I->J, G->H, C->D, I->D, A->B, E->F, A->J, E->I; Query: Path from I to E | I->D->E |
Graph: H->I, C->F, G->H, F->C, A->B, C->D, E->F, I->J, H->J, D->J, D->E, B->C, F->G; Query: Path from H to H | H |
Graph: E->F, F->G, C->D, D->E, F->D, B->C, A->B; Query: Path from D to F | D->E->F |
Graph: A->B, D->E, B->C, C->D, B->A, E->C; Query: Path from A to A | A |
Graph: C->D, B->C, A->B, A->D; Query: Path from A to A | A |
Graph: C->B, A->B, B->C; Query: Path from B to C | B->C |
Graph: B->I, D->E, F->G, G->H, C->D, B->C, E->F, D->E, A->B, F->C, H->I; Query: Path from A to D | A->B->C->D |
Graph: A->B, D->E, D->E, C->D, B->C; Query: Path from E to A | No path exists |
Graph: F->E, F->G, D->H, G->H, D->E, G->E, A->B, E->F, D->A, B->C, C->D; Query: Path from E to A | No path exists |
Graph: C->D, F->G, B->C, G->H, D->E, E->F, H->C, E->F, A->B, A->F; Query: Path from B to G | B->C->D->E->F->G |
Graph: F->G, E->F, B->C, F->A, G->H, G->H, B->C, D->E, A->B, H->I, I->J, C->D; Query: Path from C to F | C->D->E->F |
Graph: B->C, F->G, A->D, C->D, C->A, D->E, E->F, A->B; Query: Path from G to D | No path exists |
Graph: H->I, E->F, C->D, A->B, F->C, F->G, D->G, B->C, F->G, D->B, D->E, G->H; Query: Path from D to A | No path exists |
Graph: A->B, D->E, E->F, B->C, F->B, A->D, C->D, B->C; Query: Path from D to D | D |
Graph: E->F, D->E, D->B, C->D, B->C, F->G, A->B, A->B; Query: Path from E to A | No path exists |
Graph: B->C, A->B, A->B; Query: Path from B to A | No path exists |
Graph: D->E, A->B, E->F, F->A, B->C, C->D; Query: Path from A to B | A->B |
Graph: G->H, I->J, A->B, C->F, B->C, D->E, H->I, J->E, F->G, A->D, E->F, C->D; Query: Path from H to B | No path exists |
Graph: D->E, B->E, F->D, B->C, A->B, E->F, C->D; Query: Path from B to C | B->C |
Graph: D->E, H->I, D->G, I->J, E->F, I->F, C->D, F->G, B->C, G->H, A->B; Query: Path from A to I | A->B->C->D->G->H->I |
Graph: J->A, D->E, A->B, B->C, G->B, F->E, C->A, E->F, H->F, I->J, C->D, F->G, G->H, H->I; Query: Path from A to B | A->B |
Graph: E->F, D->E, F->G, B->C, C->F, C->B, C->D, B->C, A->B; Query: Path from D to B | No path exists |
Graph: A->D, C->D, A->B, B->C, D->E; Query: Path from B to D | B->C->D |
Graph: G->H, A->B, H->I, D->H, B->C, G->E, D->E, C->D, E->F, F->G, A->I; Query: Path from H to C | No path exists |
Graph: A->B, E->F, F->G, C->A, G->H, F->E, D->E, B->C, C->D; Query: Path from F to G | F->G |
Graph: D->E, H->I, G->H, C->D, F->G, B->C, A->B, A->C, E->F, I->A; Query: Path from G to B | G->H->I->A->B |
Graph: G->F, D->E, E->D, D->C, B->C, G->H, E->F, H->I, C->D, F->G, G->F, A->B; Query: Path from B to B | B |
Graph: F->G, B->H, E->B, B->C, G->H, C->D, D->E, I->J, D->C, A->B, H->I, E->F, J->I, E->G; Query: Path from E to E | E |
Graph: A->B, A->B, B->C; Query: Path from B to B | B |
Graph: D->E, C->D, F->G, A->B, B->C, E->F, G->H, C->B, B->H, A->B; Query: Path from B to F | B->C->D->E->F |
Graph: C->D, B->C, A->B, C->D, C->D; Query: Path from D to D | D |
Graph: D->A, B->C, C->D, A->B, C->A; Query: Path from D to A | D->A |
Graph: F->A, C->D, D->E, F->C, D->C, E->F, B->C, A->B; Query: Path from A to F | A->B->C->D->E->F |
Graph: D->E, C->D, B->C, D->E, F->G, B->E, A->B, G->H, E->F; Query: Path from C to A | No path exists |
Graph: C->D, D->B, D->E, E->F, A->B, F->G, G->H, B->C; Query: Path from A to F | A->B->C->D->E->F |
Graph: C->D, A->B, E->F, E->C, B->E, B->C, D->E; Query: Path from E to C | E->C |
Graph: C->D, B->C, E->B, A->B, D->E, A->D; Query: Path from A to D | A->D |
Graph: B->C, A->B, C->D, A->B; Query: Path from B to A | No path exists |
Graph: C->D, B->C, C->D, C->D, A->B; Query: Path from A to B | A->B |
Graph: A->C, D->E, C->D, B->C, A->B; Query: Path from D to D | D |
Graph: B->C, C->A, D->B, A->B, C->D; Query: Path from A to B | A->B |
Graph: A->B, A->B, B->C; Query: Path from C to A | No path exists |
Graph: C->D, C->A, A->D, A->B, B->C; Query: Path from D to B | No path exists |
Graph: F->D, A->B, E->F, D->E, A->D, C->D, B->C; Query: Path from C to C | C |
Graph: A->B, A->B, B->C; Query: Path from A to B | A->B |
Graph: H->I, G->H, A->B, B->C, C->H, H->C, I->J, D->E, C->D, J->D, J->C, F->G, E->F, G->J; Query: Path from I to C | I->J->C |
Graph: D->E, E->A, A->B, E->F, B->C, C->D; Query: Path from F to D | No path exists |
Graph: A->B, D->C, H->I, B->C, D->G, F->G, G->H, E->F, D->E, C->D; Query: Path from C to D | C->D |
Graph: D->E, E->F, A->B, D->E, C->D, E->A, D->E, B->C; Query: Path from E to C | E->A->B->C |
Graph: A->B, B->F, C->D, E->F, B->C, D->E, D->C; Query: Path from F to B | No path exists |
Graph: B->C, D->B, A->B, C->D; Query: Path from B to C | B->C |
Graph: B->C, A->B, A->B; Query: Path from A to C | A->B->C |
Graph: C->A, B->C, C->D, C->D, A->B; Query: Path from A to A | A |
Graph: A->B, C->D, B->C, D->E, G->F, G->H, F->G, F->G, E->F; Query: Path from E to B | No path exists |
Graph: A->B, B->C, A->B, C->D; Query: Path from B to D | B->C->D |
Graph: B->C, G->F, H->I, E->F, D->E, F->G, A->J, C->D, I->J, G->H, B->C, A->B, I->C; Query: Path from D to D | D |
Graph: H->I, A->B, F->G, D->E, B->C, G->H, I->B, C->D, I->J, E->F; Query: Path from B to H | B->C->D->E->F->G->H |
Graph: B->C, B->C, A->B; Query: Path from C to C | C |
Graph: C->D, E->F, A->B, B->C, F->G, E->D, D->E; Query: Path from G to F | No path exists |
Graph: G->H, A->D, E->F, D->E, C->D, B->C, G->H, F->G, E->B, A->B; Query: Path from C to E | C->D->E |
Graph: A->B, D->E, C->D, F->G, I->J, J->I, E->F, B->C, H->I, G->H; Query: Path from I to J | I->J |
Graph: B->C, G->H, D->E, H->I, E->F, B->F, F->G, A->B, A->F, I->J, C->D; Query: Path from F to H | F->G->H |
Graph: C->D, A->B, A->B, B->C; Query: Path from B 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.