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