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