instruction
stringlengths 48
114
| answer
stringlengths 1
28
|
|---|---|
Graph: B->C, E->C, A->B, D->E, C->D; Query: Path from A to C | A->B->C |
Graph: A->B, B->C, C->D, C->B, A->B; Query: Path from B to A | No path exists |
Graph: F->G, F->B, G->A, D->A, B->C, A->B, D->E, C->D, E->F; Query: Path from D to G | D->E->F->G |
Graph: D->E, G->H, F->H, D->C, C->D, H->I, B->C, E->F, A->B, F->G; Query: Path from G to H | G->H |
Graph: D->E, C->D, A->B, B->C, F->G, F->D, E->F; Query: Path from C to E | C->D->E |
Graph: C->D, B->A, B->C, D->E, A->B; Query: Path from E to E | E |
Graph: D->E, A->B, A->B, C->D, D->A, C->F, E->F, B->C; Query: Path from F to B | No path exists |
Graph: D->A, C->D, B->C, B->A, A->B; Query: Path from A to D | A->B->C->D |
Graph: D->E, B->F, E->F, D->F, B->C, A->B, D->E, C->D; Query: Path from A to E | A->B->C->D->E |
Graph: A->B, C->D, B->C, C->B; Query: Path from C to A | No path exists |
Graph: A->B, F->G, E->C, A->E, B->C, A->E, C->D, E->F, D->E; Query: Path from B to C | B->C |
Graph: A->B, J->D, C->D, G->H, F->G, D->E, I->J, H->I, B->C, E->F; Query: Path from A to J | A->B->C->D->E->F->G->H->I->J |
Graph: A->B, G->D, H->I, D->E, I->D, B->C, C->D, E->F, G->H, D->A, H->E, F->G; Query: Path from I to A | I->D->A |
Graph: D->E, B->F, C->D, B->C, B->D, C->B, A->B, E->F; Query: Path from D to C | No path exists |
Graph: C->D, D->E, E->F, A->E, B->C, A->B; Query: Path from C to E | C->D->E |
Graph: C->D, F->G, E->F, B->C, E->B, H->I, D->E, A->B, G->H, C->I; Query: Path from I to H | No path exists |
Graph: A->B, B->C, E->C, C->D, D->E; Query: Path from D to D | D |
Graph: B->C, C->H, C->D, A->B, F->G, G->H, F->G, E->F, F->A, D->E; Query: Path from B to F | B->C->D->E->F |
Graph: B->C, D->F, F->G, D->E, G->H, E->F, I->J, H->I, A->B, C->D, D->I, B->H; Query: Path from A to J | A->B->H->I->J |
Graph: F->G, D->C, D->E, B->C, E->F, A->B, B->F, C->D; Query: Path from E to A | No path exists |
Graph: D->F, D->H, H->I, G->F, I->J, F->G, A->B, G->H, E->F, D->E, B->C, C->D; Query: Path from F to D | No path exists |
Graph: B->G, A->B, D->E, B->C, C->D, B->A, E->F, F->G; Query: Path from C to B | No path exists |
Graph: E->F, G->H, B->C, C->D, I->C, A->B, H->I, D->E, B->D, C->E, F->G, H->C; Query: Path from C to C | C |
Graph: D->E, B->C, G->H, E->F, F->G, C->H, A->B, C->D; Query: Path from H to E | No path exists |
Graph: A->B, B->C, B->A; Query: Path from C to C | C |
Graph: G->C, A->B, H->I, B->C, F->G, D->E, G->H, A->G, A->G, E->F, C->D; Query: Path from D to E | D->E |
Graph: F->G, C->D, G->H, E->F, A->B, D->E, G->I, I->E, B->H, H->I, E->A, G->E, B->C, I->J; Query: Path from J to H | No path exists |
Graph: B->C, C->B, A->B; Query: Path from C to A | No path exists |
Graph: C->I, G->H, B->C, A->B, E->F, F->G, I->A, C->D, D->E, H->I, H->I, C->D; Query: Path from H to B | H->I->A->B |
Graph: D->E, A->B, B->C, B->D, E->F, C->D; Query: Path from E to B | No path exists |
Graph: C->D, B->C, A->B, B->A; Query: Path from B to D | B->C->D |
Graph: F->A, D->E, B->C, E->F, C->D, G->H, A->B, F->G, E->D; Query: Path from F to C | F->A->B->C |
Graph: D->H, C->D, G->H, C->G, B->C, E->B, D->E, F->G, A->B, B->D, E->F; Query: Path from A to E | A->B->D->E |
Graph: A->B, E->F, B->E, C->D, D->E, B->C; Query: Path from E to D | No path exists |
Graph: B->C, D->A, A->B, D->E, C->D, A->D; Query: Path from B to C | B->C |
Graph: A->B, G->H, B->C, C->I, C->D, E->F, F->G, H->I, G->C, F->G, E->F, D->E; Query: Path from I to E | No path exists |
Graph: E->F, A->B, D->E, B->C, C->E, C->D; Query: Path from E to E | E |
Graph: F->G, D->B, B->C, C->D, B->A, E->F, A->B, D->E; Query: Path from G to E | No path exists |
Graph: A->B, E->A, C->D, C->D, D->E, B->C; Query: Path from C to C | C |
Graph: D->E, C->D, A->B, B->C, C->E, E->D; Query: Path from A to B | A->B |
Graph: A->D, C->D, D->E, A->B, B->C, C->A; Query: Path from D to A | No path exists |
Graph: A->C, E->F, D->E, C->D, B->C, A->B; Query: Path from E to F | E->F |
Graph: A->B, A->B, B->C; Query: Path from C to A | No path exists |
Graph: B->C, D->E, E->F, F->D, C->D, A->B, A->F; Query: Path from F to E | F->D->E |
Graph: A->D, D->E, B->C, C->D, A->B; Query: Path from E to B | No path exists |
Graph: A->C, A->B, C->D, B->C, B->C; Query: Path from C to D | C->D |
Graph: I->J, C->J, B->C, G->H, B->E, E->I, C->G, D->E, A->B, C->D, F->G, E->F, D->F, H->I; Query: Path from I to A | No path exists |
Graph: F->G, B->C, G->H, B->F, E->F, H->I, C->D, A->B, D->E; Query: Path from F to C | No path exists |
Graph: C->D, B->C, G->F, D->E, A->B, E->F, F->G; Query: Path from E to E | E |
Graph: A->B, C->D, D->E, D->E, C->A, F->G, G->H, B->C, E->F; Query: Path from F to H | F->G->H |
Graph: D->E, I->J, A->B, B->C, C->D, H->I, A->J, F->G, G->H, E->F, A->G; Query: Path from D to F | D->E->F |
Graph: C->A, D->E, C->D, C->D, A->B, B->C; Query: Path from B to C | B->C |
Graph: D->E, E->F, B->C, F->G, C->D, A->B, G->D; Query: Path from B to B | B |
Graph: C->D, D->B, D->E, B->C, A->B, D->E; Query: Path from A to A | A |
Graph: B->C, F->G, B->E, E->F, D->E, D->C, A->B, C->D; Query: Path from A to G | A->B->E->F->G |
Graph: C->D, B->C, A->B, G->C, D->E, G->H, E->F, A->H, F->G, B->E; Query: Path from C to E | C->D->E |
Graph: C->D, D->B, A->B, C->D, B->C; Query: Path from A to A | A |
Graph: E->F, D->F, A->B, F->G, D->E, C->D, B->C, G->H, H->G; Query: Path from B to G | B->C->D->E->F->G |
Graph: A->D, A->B, B->C, C->D; Query: Path from C to C | C |
Graph: D->E, C->D, A->B, B->C, E->F, F->G, G->H, F->H, D->E; Query: Path from G to B | No path exists |
Graph: D->E, C->D, D->A, G->H, F->G, A->B, B->C, H->I, E->F; Query: Path from G to H | G->H |
Graph: F->C, C->D, A->B, B->C, F->G, D->E, E->A, E->F, H->I, G->H, D->H; Query: Path from H to G | No path exists |
Graph: B->C, E->F, C->D, D->E, F->G, A->B, C->B; Query: Path from F to E | No path exists |
Graph: D->E, C->G, C->D, A->F, F->G, D->B, B->C, A->B, G->H, E->F; Query: Path from F to E | No path exists |
Graph: A->B, B->C, D->E, C->D, A->C; Query: Path from C to D | C->D |
Graph: B->C, E->B, C->D, A->B, D->E; Query: Path from C to D | C->D |
Graph: D->E, C->D, A->B, B->C, A->D; Query: Path from B to B | B |
Graph: C->D, F->G, B->C, B->A, D->E, F->E, E->F, A->B; Query: Path from C to E | C->D->E |
Graph: D->E, E->B, I->J, G->H, C->D, F->G, E->F, A->B, B->C, F->G, A->B, C->D, H->I; Query: Path from A to A | A |
Graph: B->C, F->G, C->D, E->F, D->E, A->B, D->C; Query: Path from B to A | No path exists |
Graph: G->A, G->H, D->E, C->D, B->C, F->D, G->H, H->I, A->B, F->G, E->F, F->G; Query: Path from G to A | G->A |
Graph: A->D, A->B, C->D, B->C, D->B; Query: Path from A to B | A->B |
Graph: D->E, A->B, C->D, B->C, B->D; Query: Path from C to E | C->D->E |
Graph: F->G, C->D, J->E, A->B, H->I, F->D, B->C, D->J, B->C, D->E, I->J, J->B, G->H, E->F; Query: Path from G to B | G->H->I->J->B |
Graph: B->C, A->B, A->C; Query: Path from B to B | B |
Graph: C->A, A->B, B->C; Query: Path from A to C | A->B->C |
Graph: C->D, F->G, B->C, D->E, E->F, A->B, B->C; Query: Path from C to F | C->D->E->F |
Graph: B->C, C->D, C->D, A->B, C->A; Query: Path from D to B | No path exists |
Graph: E->F, C->E, G->H, D->E, C->D, H->I, A->B, I->J, F->G, E->I, B->C; Query: Path from C to I | C->D->E->I |
Graph: B->A, C->D, B->C, A->B, B->A; Query: Path from C to D | C->D |
Graph: A->B, G->I, E->F, D->E, E->F, B->C, H->I, C->D, F->H, F->G, G->H; Query: Path from E to A | No path exists |
Graph: C->D, B->C, A->B, D->E, D->B, C->D; Query: Path from C to B | C->D->B |
Graph: A->H, H->I, E->F, A->G, D->E, B->D, B->C, G->H, A->B, F->G, H->I, C->D; Query: Path from E to F | E->F |
Graph: D->E, F->G, A->F, C->D, B->C, A->B, A->D, F->C, E->F; Query: Path from C to A | No path exists |
Graph: A->B, C->D, F->A, B->C, C->F, E->F, D->E; Query: Path from B to C | B->C |
Graph: C->D, B->D, B->C, B->C, A->B; Query: Path from B to B | B |
Graph: B->C, F->G, E->F, C->D, A->B, E->F, D->E, A->B; Query: Path from G to C | No path exists |
Graph: B->J, A->B, I->J, F->G, G->F, G->H, H->I, B->C, E->F, F->E, A->B, I->H, C->D, D->E; Query: Path from D to C | No path exists |
Graph: C->D, D->E, B->A, B->C, A->B; Query: Path from D to A | No path exists |
Graph: A->F, B->C, E->F, C->D, D->E, A->D, A->B; Query: Path from E to B | No path exists |
Graph: A->B, B->C, B->C, C->D; Query: Path from A to C | A->B->C |
Graph: E->F, F->H, H->I, A->B, F->G, D->E, C->D, B->C, G->H; Query: Path from H to D | No path exists |
Graph: A->B, E->F, F->A, G->H, F->G, B->E, C->D, B->C, D->E; Query: Path from A to E | A->B->C->D->E |
Graph: D->A, F->G, C->D, E->F, D->E, F->E, B->C, A->B; Query: Path from G to C | No path exists |
Graph: C->G, B->C, F->G, D->E, E->F, D->C, A->B, B->E, C->D; Query: Path from B to E | B->E |
Graph: F->G, I->J, G->H, H->I, J->A, D->E, D->A, A->B, B->C, C->D, E->A, E->F, H->D; Query: Path from H to F | H->D->E->F |
Graph: B->C, A->B, D->B, C->D, G->H, B->A, B->H, E->F, F->G, E->F, D->E; Query: Path from F to E | No path exists |
Graph: I->D, E->F, I->J, D->E, F->G, A->B, H->I, C->D, G->H, B->C; Query: Path from G to G | G |
Graph: B->C, C->D, F->C, D->E, G->D, A->B, F->G, E->F; Query: Path from G to A | No path exists |
Graph: A->B, C->D, D->E, C->D, E->A, B->C; Query: Path from E to E | E |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.