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