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