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