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