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