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