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