instruction
stringlengths 48
114
| answer
stringlengths 1
28
|
|---|---|
Graph: A->B, E->F, B->C, C->D, D->C, D->E; Query: Path from C to B | No path exists |
Graph: I->B, B->C, E->F, F->G, A->B, D->E, C->D, G->H, H->I, G->I; Query: Path from H to H | H |
Graph: E->F, A->B, B->C, I->H, E->I, H->I, D->E, C->D, G->H, F->G, H->C; Query: Path from I to F | I->H->C->D->E->F |
Graph: E->F, F->G, A->B, D->E, G->D, B->C, C->D; Query: Path from G to D | G->D |
Graph: D->E, G->H, F->G, H->B, C->D, E->F, A->H, B->C, A->B; Query: Path from H to H | H |
Graph: D->E, E->A, B->C, C->D, D->E, A->B; Query: Path from C to A | C->D->E->A |
Graph: D->E, F->G, C->D, A->B, F->C, E->F, B->C, C->B; Query: Path from C to C | C |
Graph: C->D, A->D, A->C, B->C, A->B; Query: Path from A to C | A->B->C |
Graph: A->B, C->D, B->A, C->B, B->C; Query: Path from C to D | C->D |
Graph: F->B, H->I, D->E, A->H, E->F, B->C, D->G, G->H, A->B, C->I, C->D, F->G; Query: Path from A to D | A->B->C->D |
Graph: D->E, G->H, A->B, F->G, C->D, J->I, I->J, H->I, E->F, B->C; Query: Path from G to B | No path exists |
Graph: E->F, F->G, A->B, I->J, F->C, D->C, J->C, H->I, C->D, D->E, B->C, G->H; Query: Path from E to H | E->F->G->H |
Graph: C->D, D->C, B->C, A->B; Query: Path from C to A | No path exists |
Graph: B->C, C->D, C->A, D->B, A->B; Query: Path from D to C | D->B->C |
Graph: B->C, C->D, A->D, D->C, A->B; Query: Path from B to C | B->C |
Graph: B->C, C->D, C->B, B->D, A->B; Query: Path from C to D | C->B->D |
Graph: B->C, C->A, A->B; Query: Path from B to C | B->C |
Graph: A->B, B->C, B->C; Query: Path from A to B | A->B |
Graph: E->C, A->B, C->D, D->E, B->C; Query: Path from A to D | A->B->C->D |
Graph: E->C, B->C, F->G, D->E, C->D, E->F, G->H, A->B; Query: Path from E to D | E->C->D |
Graph: B->C, D->E, D->A, C->D, E->F, A->B; Query: Path from A to A | A |
Graph: A->B, C->D, B->C, D->C; Query: Path from D to C | D->C |
Graph: G->H, D->A, E->F, F->G, A->B, E->F, B->C, D->E, C->D, D->H; Query: Path from G to A | No path exists |
Graph: B->C, A->B, D->A, C->D, D->E; Query: Path from E to E | E |
Graph: B->C, E->F, C->A, C->B, A->C, D->E, A->B, C->D; Query: Path from B to E | B->C->D->E |
Graph: B->C, C->D, H->E, A->B, H->D, E->F, G->H, C->B, D->E, H->I, F->G, E->F; Query: Path from E to C | No path exists |
Graph: B->C, C->D, D->E, B->C, A->B; Query: Path from A to A | A |
Graph: C->D, A->B, A->D, B->C, D->E; Query: Path from E to D | No path exists |
Graph: A->B, B->C, B->C, C->D, D->E; Query: Path from B to C | B->C |
Graph: A->B, D->E, C->D, B->C, A->D; Query: Path from C to B | No path exists |
Graph: F->G, H->I, E->F, D->E, H->C, C->D, B->C, G->H, I->H, A->B, I->J; Query: Path from D to C | D->E->F->G->H->C |
Graph: A->D, B->C, F->G, D->G, F->B, A->B, C->D, E->F, D->E; Query: Path from F to C | F->B->C |
Graph: A->E, D->E, A->B, D->E, E->F, B->C, C->D; Query: Path from F to A | No path exists |
Graph: B->C, C->D, C->B, A->B; Query: Path from B to A | No path exists |
Graph: A->B, C->D, H->I, B->C, I->J, G->D, C->H, F->G, G->H, E->F, D->E; Query: Path from H to B | No path exists |
Graph: E->F, F->G, G->H, E->I, A->F, B->C, D->E, H->J, C->D, H->I, A->B, I->J, A->G; Query: Path from J to D | No path exists |
Graph: F->C, C->D, D->E, E->F, A->B, H->C, G->H, B->C, F->G; Query: Path from B to B | B |
Graph: A->B, B->C, C->D, G->H, E->C, D->E, E->F, F->G, F->A; Query: Path from E to B | E->F->A->B |
Graph: A->D, A->B, G->H, E->F, B->D, B->C, H->C, D->E, F->G, F->B, C->D; Query: Path from G to C | G->H->C |
Graph: B->C, C->D, E->C, A->B, D->B, D->E; Query: Path from C to B | C->D->B |
Graph: E->F, A->B, F->E, D->B, B->C, C->D, D->E; Query: Path from E to F | E->F |
Graph: D->E, C->D, A->B, E->F, E->F, F->G, F->D, B->C; Query: Path from B to C | B->C |
Graph: B->C, G->C, A->B, D->E, F->G, C->D, H->I, G->H, E->F; Query: Path from H to D | No path exists |
Graph: F->G, B->C, B->C, C->D, E->F, D->E, A->B; Query: Path from D to D | D |
Graph: G->B, E->F, F->G, F->C, C->D, B->C, D->E, B->D, A->B; Query: Path from B to G | B->D->E->F->G |
Graph: C->D, B->C, C->D, A->B, A->B; Query: Path from C to B | No path exists |
Graph: A->B, B->C, B->A; Query: Path from A to A | A |
Graph: C->D, A->B, D->A, B->C; Query: Path from D to B | D->A->B |
Graph: A->B, E->F, B->C, D->F, A->E, D->E, C->D, F->G; Query: Path from E to B | No path exists |
Graph: H->D, C->D, A->B, H->I, D->E, E->F, I->J, B->C, F->G, G->H; Query: Path from B to E | B->C->D->E |
Graph: B->C, D->E, F->H, E->F, F->G, A->B, G->H, C->D; Query: Path from A to A | A |
Graph: E->F, B->C, C->D, E->D, D->E, A->B, D->C; Query: Path from C to C | C |
Graph: E->F, D->E, C->D, D->C, B->C, F->G, A->B, C->F; Query: Path from F to D | No path exists |
Graph: E->F, A->B, A->B, D->E, C->D, B->C; Query: Path from A to B | A->B |
Graph: D->E, B->C, A->B, E->F, F->D, C->D; Query: Path from B to D | B->C->D |
Graph: G->H, E->F, F->G, H->I, A->B, C->D, D->E, B->C, J->G, I->J; Query: Path from H to D | No path exists |
Graph: A->B, F->G, C->D, E->F, D->E, G->H, G->H, D->E, F->B, B->C; Query: Path from C to D | C->D |
Graph: B->D, C->D, B->C, A->B; Query: Path from A to D | A->B->C->D |
Graph: D->E, A->B, G->H, B->C, C->D, H->I, E->G, F->G, I->J, E->F; Query: Path from H to H | H |
Graph: G->H, I->J, E->F, C->D, F->G, F->G, E->I, D->E, C->I, A->B, H->I, B->C; Query: Path from G to A | No path exists |
Graph: A->G, G->H, C->I, B->G, A->B, F->G, D->E, E->F, C->D, B->C, H->I; Query: Path from A to G | A->B->C->D->E->F->G |
Graph: D->C, A->B, B->C, C->D; Query: Path from C to A | No path exists |
Graph: C->A, A->B, C->D, B->C; Query: Path from A to A | A |
Graph: D->E, G->E, C->D, A->B, B->C, A->B, E->F, G->H, F->G; Query: Path from G to H | G->H |
Graph: B->A, B->C, A->B; Query: Path from C to C | C |
Graph: H->I, A->B, I->H, C->D, E->F, D->E, F->G, B->C, G->D, D->H, G->H; Query: Path from B to H | B->C->D->H |
Graph: D->E, E->F, F->G, A->B, G->C, A->C, C->D, E->D, B->C; Query: Path from A to B | A->B |
Graph: D->E, B->C, E->F, F->G, A->B, C->D, B->E; Query: Path from E to B | No path exists |
Graph: A->B, D->E, F->G, B->C, G->H, C->D, H->B, E->F, G->H; Query: Path from G to H | G->H |
Graph: G->H, B->C, B->A, F->C, E->F, C->D, H->I, F->G, D->E, F->E, A->B, B->F; Query: Path from D to G | D->E->F->G |
Graph: I->J, C->D, J->H, A->G, F->G, H->I, B->C, D->G, E->F, F->G, A->B, D->E, G->H; Query: Path from F to D | No path exists |
Graph: C->D, D->A, F->G, E->F, H->D, G->H, A->B, B->C, D->E; Query: Path from G to F | G->H->D->E->F |
Graph: E->F, D->A, B->C, D->C, F->G, A->B, C->D, D->E, F->D; Query: Path from G to E | No path exists |
Graph: C->D, A->B, A->E, B->C, D->E; Query: Path from A to D | A->B->C->D |
Graph: A->B, C->D, B->C, A->B; Query: Path from B to B | B |
Graph: H->E, A->H, H->A, B->C, E->F, D->E, C->D, A->B, G->H, F->G; Query: Path from F to H | F->G->H |
Graph: D->E, B->C, C->E, A->B, C->D, A->B; Query: Path from B to C | B->C |
Graph: E->F, G->H, A->D, H->I, F->G, A->B, D->E, D->B, B->C, I->G, C->D; Query: Path from I to I | I |
Graph: A->B, B->C, E->F, D->E, F->G, A->B, G->H, I->B, C->D, I->A, H->I; Query: Path from D to C | D->E->F->G->H->I->A->B->C |
Graph: A->B, B->A, B->C; Query: Path from A to A | A |
Graph: B->C, A->C, A->B, C->D; Query: Path from D to A | No path exists |
Graph: B->C, F->G, F->G, E->F, C->D, E->H, A->B, D->E, H->A, G->H, A->D, H->I; Query: Path from C to B | C->D->E->H->A->B |
Graph: D->E, F->G, H->D, C->D, B->C, E->F, B->H, A->B, C->G, G->H, H->I; Query: Path from B to C | B->C |
Graph: B->C, A->B, A->C; Query: Path from A to B | A->B |
Graph: E->F, A->B, H->I, B->C, H->C, F->G, C->D, D->E, B->I, G->H; Query: Path from F to B | No path exists |
Graph: C->E, B->C, A->B, C->D, D->E, A->D; Query: Path from B to D | B->C->D |
Graph: D->E, B->C, A->B, F->G, E->F, I->J, G->H, H->I, F->E, C->D; Query: Path from B to B | B |
Graph: E->B, A->B, B->C, F->G, E->F, C->F, F->A, D->E, C->D; Query: Path from E to A | E->F->A |
Graph: E->F, A->B, F->C, C->A, D->E, C->D, B->C; Query: Path from D to E | D->E |
Graph: E->F, D->B, A->B, C->D, B->C, D->E; Query: Path from E to D | No path exists |
Graph: A->B, F->G, C->D, B->C, F->D, D->E, E->F; Query: Path from D to F | D->E->F |
Graph: B->C, A->C, A->B; Query: Path from A to A | A |
Graph: C->D, G->H, E->F, D->E, C->E, B->C, F->G, A->B, B->G; Query: Path from A to D | A->B->C->D |
Graph: I->J, A->H, G->H, D->E, B->C, F->G, C->D, A->B, H->I, E->F; Query: Path from H to H | H |
Graph: E->F, H->I, A->B, G->H, B->C, F->H, C->D, A->H, D->E, F->G; Query: Path from E to B | No path exists |
Graph: C->A, A->B, C->D, D->E, B->C, C->B; Query: Path from C to B | C->B |
Graph: B->C, C->B, A->B; Query: Path from C to C | C |
Graph: C->D, E->F, A->D, G->H, G->A, F->G, B->C, F->C, D->E, A->B; Query: Path from A to H | A->B->C->D->E->F->G->H |
Graph: G->H, B->C, C->D, H->B, E->F, G->F, F->G, H->E, A->B, C->D, D->E; Query: Path from F to A | No path exists |
Graph: F->G, G->H, A->B, B->C, D->C, D->G, D->E, E->F, G->F, C->D, H->I, F->H; Query: Path from B to G | B->C->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.