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