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