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