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