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