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