instruction
stringlengths 48
114
| answer
stringlengths 1
28
|
|---|---|
Graph: G->H, F->G, D->E, H->I, B->F, C->D, B->C, E->F, A->B; Query: Path from G to F | No path exists |
Graph: F->G, G->H, B->C, E->F, A->B, E->D, F->D, G->C, C->D, D->E, G->F; Query: Path from G to F | G->F |
Graph: A->C, B->C, A->B; Query: Path from B to C | B->C |
Graph: C->D, B->C, C->D, D->E, A->B; Query: Path from C to B | No path exists |
Graph: B->C, D->E, G->H, D->E, A->F, E->F, F->G, H->I, A->B, I->J, C->D; Query: Path from A to J | A->B->C->D->E->F->G->H->I->J |
Graph: C->D, F->A, F->G, E->F, D->E, A->B, G->H, B->C, H->I; Query: Path from A to D | A->B->C->D |
Graph: F->G, A->B, H->I, A->F, C->D, B->I, E->F, B->C, D->E, G->H, A->E, H->I; Query: Path from G to A | No path exists |
Graph: C->D, B->C, J->G, B->C, G->H, C->I, F->G, E->F, H->I, I->J, A->B, D->E; Query: Path from H to F | No path exists |
Graph: I->G, E->C, D->A, E->F, G->H, D->E, C->D, F->G, B->C, H->I, C->H, A->B; Query: Path from D to D | D |
Graph: B->C, F->G, I->B, G->H, G->H, D->E, H->I, B->F, C->D, C->B, A->B, E->F; Query: Path from H to B | H->I->B |
Graph: B->F, A->E, C->D, F->G, B->C, A->B, E->F, H->I, D->E, G->H, C->D; Query: Path from F to B | No path exists |
Graph: C->D, B->C, D->C, A->B; Query: Path from D to A | No path exists |
Graph: F->G, D->E, B->C, F->C, C->E, C->D, A->B, E->F; Query: Path from E to G | E->F->G |
Graph: D->E, A->B, C->D, D->E, E->A, C->B, E->F, B->C; Query: Path from A to E | A->B->C->D->E |
Graph: F->G, B->C, C->D, H->I, D->E, A->B, G->H, G->B, E->F; Query: Path from B to B | B |
Graph: E->F, B->C, D->E, G->H, A->I, C->E, H->I, C->D, C->A, G->H, I->J, F->G, A->B; Query: Path from H to J | H->I->J |
Graph: D->A, E->F, C->H, D->A, C->D, D->E, A->B, G->H, A->H, B->C, F->G; Query: Path from E to E | E |
Graph: I->D, E->F, G->H, J->F, D->E, H->I, I->J, J->E, A->B, E->B, B->C, F->G, C->D; Query: Path from J to C | J->E->B->C |
Graph: A->C, A->B, D->E, B->C, C->D, D->E; Query: Path from B to E | B->C->D->E |
Graph: F->G, C->A, B->C, E->F, C->D, G->H, E->B, A->B, E->C, D->E; Query: Path from E to B | E->C->A->B |
Graph: A->B, G->H, D->E, E->F, D->E, B->C, C->D, F->G; Query: Path from A to D | A->B->C->D |
Graph: I->J, E->F, A->B, F->C, G->H, B->C, H->I, B->H, D->E, C->D, F->G; Query: Path from J to F | No path exists |
Graph: D->E, I->J, H->I, I->A, B->C, G->C, C->D, H->D, G->F, F->G, E->F, G->H, D->F, A->B; Query: Path from I to C | I->A->B->C |
Graph: G->H, E->F, F->G, I->H, B->C, F->I, A->B, H->I, D->E, C->D; Query: Path from D to G | D->E->F->G |
Graph: B->C, A->B, B->C; Query: Path from C to A | No path exists |
Graph: G->H, D->E, G->H, E->F, H->I, C->D, D->B, B->C, A->B, F->G; Query: Path from A to D | A->B->C->D |
Graph: A->B, B->C, E->F, F->G, C->D, G->C, D->E; Query: Path from B to F | B->C->D->E->F |
Graph: B->C, D->E, F->G, C->D, G->H, E->F, A->B, H->I, I->J, D->H; Query: Path from I to J | I->J |
Graph: A->B, B->C, C->D, B->C; Query: Path from C to D | C->D |
Graph: H->G, G->C, G->H, D->E, C->D, B->C, A->B, F->G, E->F; Query: Path from C to A | No path exists |
Graph: D->C, C->D, A->B, D->E, E->F, B->C, F->C; Query: Path from E to A | No path exists |
Graph: B->C, H->I, I->G, F->G, C->D, I->J, E->F, D->E, G->H, A->B; Query: Path from G to I | G->H->I |
Graph: A->D, F->B, B->C, A->B, D->E, E->B, E->F, C->D; Query: Path from D to E | D->E |
Graph: C->D, D->F, E->F, B->C, D->E, A->B, B->G, G->F, G->H, F->G, A->B; Query: Path from G to E | No path exists |
Graph: B->D, A->B, C->D, B->C; Query: Path from D to A | No path exists |
Graph: C->D, A->B, B->C, A->B; Query: Path from B to D | B->C->D |
Graph: A->B, B->C, B->A; Query: Path from C to C | C |
Graph: F->G, B->D, D->E, E->F, B->C, A->B, G->C, C->D; Query: Path from D to G | D->E->F->G |
Graph: F->G, D->E, B->I, G->H, C->D, H->I, B->C, E->F, A->B, I->D; Query: Path from H to F | H->I->D->E->F |
Graph: F->G, G->H, C->D, A->B, I->B, I->A, D->E, E->F, H->I, C->B, B->C; Query: Path from B to B | B |
Graph: C->D, C->D, D->E, C->D, B->C, A->B; Query: Path from A to B | A->B |
Graph: C->D, A->B, A->B, A->B, B->C; Query: Path from C to A | No path exists |
Graph: B->A, B->C, D->A, C->D, A->B; Query: Path from C to B | C->D->A->B |
Graph: C->D, H->I, B->C, E->F, I->J, G->H, I->B, D->E, F->G, G->B, A->B; Query: Path from F to B | F->G->B |
Graph: C->D, B->C, D->E, B->F, A->B, F->B, E->F; Query: Path from A to B | A->B |
Graph: B->C, C->B, A->B; Query: Path from B to B | B |
Graph: C->D, E->F, D->G, F->G, G->H, B->C, D->E, H->I, A->B; Query: Path from F to A | No path exists |
Graph: A->B, B->C, C->A; Query: Path from A to A | A |
Graph: E->F, A->F, D->B, A->B, C->D, B->C, D->E; Query: Path from E to C | No path exists |
Graph: B->C, E->F, D->E, G->H, C->D, H->D, H->I, F->G, A->B; Query: Path from C to A | No path exists |
Graph: H->I, E->F, E->B, A->B, C->E, B->C, C->D, D->A, G->H, F->G, D->E, A->H; Query: Path from D to I | D->E->F->G->H->I |
Graph: F->G, D->E, B->C, E->B, C->D, E->F, G->H, F->G, B->E, A->B, D->E; Query: Path from G to H | G->H |
Graph: G->H, C->D, F->G, A->B, B->C, B->F, D->E, E->F; Query: Path from F to A | No path exists |
Graph: A->B, B->C, C->B; Query: Path from B to C | B->C |
Graph: B->C, D->E, C->F, F->G, E->F, G->F, A->B, C->D; Query: Path from B to B | B |
Graph: B->C, D->E, A->D, A->B, C->D; Query: Path from D to A | No path exists |
Graph: D->B, C->D, C->A, B->C, A->B; Query: Path from D to C | D->B->C |
Graph: B->A, A->B, B->C; Query: Path from C to A | No path exists |
Graph: A->B, B->C, E->F, F->E, C->D, D->E, F->G; Query: Path from G to B | No path exists |
Graph: A->B, B->C, A->B; Query: Path from A to A | A |
Graph: F->C, E->F, B->C, A->B, C->D, B->C, D->E; Query: Path from B to F | B->C->D->E->F |
Graph: H->I, G->H, B->C, J->H, I->J, C->D, A->B, D->E, F->G, E->F; Query: Path from I to A | No path exists |
Graph: A->B, C->A, B->C; Query: Path from B to B | B |
Graph: D->E, B->D, A->B, C->D, E->F, B->C, D->C; Query: Path from F to A | No path exists |
Graph: A->B, C->A, B->C; Query: Path from A to C | A->B->C |
Graph: C->D, D->C, C->B, B->C, A->B; Query: Path from A to D | A->B->C->D |
Graph: C->D, F->G, E->F, B->C, A->B, D->E, D->A; Query: Path from B to C | B->C |
Graph: G->H, E->F, C->D, A->B, F->G, E->F, D->E, B->H, B->C; Query: Path from E to B | No path exists |
Graph: C->D, D->E, D->H, B->G, G->H, B->C, H->I, E->F, I->J, F->G, A->B, E->A; Query: Path from J to D | No path exists |
Graph: F->D, A->B, B->C, A->E, D->E, E->F, E->A, C->D; Query: Path from B to A | B->C->D->E->A |
Graph: D->E, E->F, G->E, G->H, A->B, C->D, B->C, G->H, F->G, G->E, H->I; Query: Path from B to E | B->C->D->E |
Graph: D->A, B->C, E->F, B->C, A->B, D->E, E->F, C->D; Query: Path from F to C | No path exists |
Graph: B->C, B->D, A->B, B->C, C->D; Query: Path from B to D | B->C->D |
Graph: D->E, B->G, F->G, E->F, B->C, C->D, G->H, A->B; Query: Path from F to D | No path exists |
Graph: B->C, B->A, A->B; Query: Path from A to A | A |
Graph: C->D, A->B, B->C, E->F, A->F, F->G, D->E; Query: Path from F to F | F |
Graph: C->D, A->B, B->C, A->B; Query: Path from D to A | No path exists |
Graph: A->B, E->A, C->D, G->E, F->G, E->C, G->H, E->G, D->E, E->F, B->C; Query: Path from D to B | D->E->A->B |
Graph: G->E, E->F, A->B, F->E, D->E, F->G, B->C, G->H, C->D, G->D; Query: Path from D to C | No path exists |
Graph: D->A, D->E, C->D, A->B, E->F, F->G, B->C; Query: Path from C to D | C->D |
Graph: C->D, E->D, B->E, B->D, F->G, E->F, B->C, D->E, G->H, H->I, A->B; Query: Path from G to A | No path exists |
Graph: E->F, D->E, B->D, G->H, C->D, F->G, B->C, A->B; Query: Path from D to H | D->E->F->G->H |
Graph: F->G, F->B, D->B, E->A, C->D, E->F, A->B, D->E, B->C; Query: Path from B to C | B->C |
Graph: E->F, F->G, H->I, D->E, G->I, I->J, A->B, B->C, G->H, C->D; Query: Path from A to H | A->B->C->D->E->F->G->H |
Graph: D->E, E->F, B->C, A->B, D->B, C->D, D->E; Query: Path from C to D | C->D |
Graph: A->B, F->G, D->E, B->C, C->D, F->A, E->F, B->A; Query: Path from B to D | B->C->D |
Graph: B->C, C->B, A->B; Query: Path from A to A | A |
Graph: F->A, B->C, C->D, D->E, E->F, A->B, D->E, F->G, F->C; Query: Path from A to E | A->B->C->D->E |
Graph: B->C, A->B, B->C; Query: Path from C to C | C |
Graph: A->D, B->C, C->D, A->B, D->E, B->C; Query: Path from B to D | B->C->D |
Graph: C->D, C->E, D->E, E->F, A->B, B->C; Query: Path from B to B | B |
Graph: C->D, A->B, D->E, B->C, E->F, F->A, C->F, A->B; Query: Path from F to A | F->A |
Graph: E->F, A->B, C->D, F->G, D->E, E->C, H->I, B->C, H->D, G->H, H->G; Query: Path from H to I | H->I |
Graph: C->B, A->B, C->D, B->C; Query: Path from C to B | C->B |
Graph: A->B, A->C, B->C; Query: Path from A to B | A->B |
Graph: A->B, B->C, A->B; Query: Path from C to B | No path exists |
Graph: F->G, H->I, C->H, C->D, G->H, B->C, D->E, A->B, E->F; Query: Path from A to F | A->B->C->D->E->F |
Graph: A->B, C->A, B->C; Query: Path from C to A | C->A |
Graph: B->C, A->B, D->E, C->D, D->B; Query: Path from A to E | A->B->C->D->E |
Graph: A->B, B->C, D->A, D->E, C->D; Query: Path from B to E | B->C->D->E |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.