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