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