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