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