lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

Graph: D->E, E->B, C->E, B->C, B->D, A->B, C->D, E->F, F->G; Query: Path from E to G

E->F->G

Graph: B->C, B->A, A->B; Query: Path from A to B

A->B

Graph: B->C, E->C, A->B, E->F, D->E, C->D, E->F, D->F; Query: Path from D to A

No path exists

Graph: G->H, A->B, E->F, B->C, I->J, C->D, F->G, H->I, D->H, D->E, A->D; Query: Path from A to F

A->D->E->F

Graph: B->C, A->B, B->A; Query: Path from A to B

A->B

Graph: I->J, A->B, J->F, F->G, G->H, H->I, B->C, C->D, E->F, A->J, D->E; Query: Path from C to D

C->D

Graph: B->C, B->A, A->B; Query: Path from B to C

B->C

Graph: B->C, A->B, B->D, D->A, C->D; Query: Path from D to A

D->A

Graph: A->B, B->A, C->D, B->C; Query: Path from C to C

C

Graph: G->H, H->I, E->F, B->C, I->E, A->D, A->B, D->E, F->G, C->D; Query: Path from D to B

No path exists

Graph: B->C, G->H, H->I, A->B, D->E, E->F, C->D, I->G, B->C, H->I, I->J, H->C, I->F, F->G; Query: Path from D to H

D->E->F->G->H

Graph: B->C, A->B, D->E, D->F, C->D, B->C, E->F; Query: Path from B to A

No path exists

Graph: B->E, E->C, B->C, C->D, F->G, E->F, D->E, A->B; Query: Path from D to D

D

Graph: H->F, E->G, A->C, F->G, G->H, A->B, C->D, B->C, E->F, D->E, H->I; Query: Path from B to B

B

Graph: A->B, A->C, B->D, C->D, B->C; Query: Path from C to B

No path exists

Graph: C->D, A->C, B->C, A->B, C->E, D->E; Query: Path from D to B

No path exists

Graph: E->F, D->B, B->C, A->B, C->D, D->E, F->B, E->F; Query: Path from D to F

D->E->F

Graph: E->F, B->C, G->H, D->E, A->B, I->A, H->I, H->I, C->D, F->G; Query: Path from F to D

F->G->H->I->A->B->C->D

Graph: C->D, H->I, E->F, F->G, A->B, D->E, B->C, G->E, G->H, C->F, A->C, F->A; Query: Path from B to F

B->C->F

Graph: G->H, E->F, F->G, B->I, D->E, I->J, B->C, C->D, A->B, H->I, B->C, C->A; Query: Path from E to I

E->F->G->H->I

Graph: A->D, A->B, B->C, A->B, C->D; Query: Path from A to B

A->B

Graph: B->C, G->H, A->B, G->H, H->I, F->G, B->G, D->E, E->F, D->E, D->C, C->D; Query: Path from C to H

C->D->E->F->G->H

Graph: C->D, A->B, B->C, C->D, B->C; Query: Path from A to C

A->B->C

Graph: G->D, D->E, I->J, A->B, E->F, B->C, F->G, J->C, H->I, G->H, E->G, C->D; Query: Path from D to C

D->E->G->H->I->J->C

Graph: B->C, E->C, F->G, C->D, A->B, E->F, F->G, F->A, D->E; Query: Path from E to G

E->F->G

Graph: E->F, C->D, A->B, E->B, B->C, D->E, A->D, F->G, G->H, H->B, A->H; Query: Path from E to B

E->B

Graph: D->A, D->E, C->D, B->C, D->E, A->B; Query: Path from B to D

B->C->D

Graph: D->E, B->A, F->G, C->D, B->C, A->B, E->F; Query: Path from B to A

B->A

Graph: A->B, A->B, B->C; Query: Path from A to C

A->B->C

Graph: B->C, A->B, B->A; Query: Path from B to C

B->C

Graph: E->F, D->E, A->B, C->D, F->G, B->C, A->G, A->E; Query: Path from A to A

A

Graph: C->D, A->F, F->G, E->F, G->H, A->B, H->I, B->C, D->E; Query: Path from I to B

No path exists

Graph: E->F, D->E, G->H, G->D, F->G, C->D, A->B, D->E, D->E, B->C; Query: Path from F to A

No path exists

Graph: G->H, H->D, E->F, C->D, D->E, B->C, H->I, A->B, F->G, B->E; Query: Path from B to I

B->E->F->G->H->I

Graph: A->B, A->C, D->E, D->B, B->C, C->D; Query: Path from A to C

A->C

Graph: B->C, A->B, B->A; Query: Path from A to A

A

Graph: B->C, C->D, B->C, A->B, D->A; Query: Path from C to D

C->D

Graph: E->F, D->E, C->D, B->D, A->B, F->G, B->C; Query: Path from F to C

No path exists

Graph: C->A, B->C, D->E, A->B, C->D, E->D; Query: Path from C to B

C->A->B

Graph: C->D, E->D, F->B, E->F, A->B, D->E, B->C, A->B; Query: Path from B to A

No path exists

Graph: D->E, C->D, A->B, B->A, B->C; Query: Path from D to D

D

Graph: A->B, C->D, F->G, E->F, F->B, D->E, B->C; Query: Path from E to D

E->F->B->C->D

Graph: A->B, C->D, D->A, E->F, C->D, B->C, D->E; Query: Path from B to D

B->C->D

Graph: B->A, A->B, B->C; Query: Path from C to C

C

Graph: C->D, B->C, A->B, D->E, D->E, C->D; Query: Path from B to D

B->C->D

Graph: B->A, D->E, B->C, C->D, E->F, A->B; Query: Path from D to D

D

Graph: A->B, B->C, H->C, A->H, G->E, F->G, B->D, E->F, G->H, D->E, C->D; Query: Path from A to G

A->H->C->D->E->F->G

Graph: G->H, F->G, A->F, D->H, B->C, D->E, H->I, E->F, C->D, A->B; Query: Path from A to B

A->B

Graph: C->D, A->C, A->B, D->C, B->C; Query: Path from C to C

C

Graph: C->D, B->F, F->G, G->B, H->I, C->E, B->C, A->B, E->F, G->H, D->E; Query: Path from I to G

No path exists

Graph: B->F, D->B, F->G, A->B, E->F, B->C, B->C, D->E, C->D; Query: Path from B to B

B

Graph: A->B, A->B, B->C; Query: Path from C to C

C

Graph: C->D, A->B, B->C, A->B; Query: Path from C to A

No path exists

Graph: C->D, D->E, B->C, E->F, G->H, A->B, F->G, D->H; Query: Path from A to B

A->B

Graph: A->B, A->D, B->C, D->E, E->F, C->D, E->F, C->D; Query: Path from F to C

No path exists

Graph: D->E, F->H, B->C, E->F, G->D, C->D, G->H, F->G, A->B; Query: Path from C to A

No path exists

Graph: B->C, A->B, C->D, D->C, B->D; Query: Path from A to C

A->B->D->C

Graph: A->B, B->C, A->B; Query: Path from A to C

A->B->C

Graph: E->F, G->H, F->G, F->G, H->I, H->B, B->C, A->B, G->E, I->J, C->D, D->E, J->B; Query: Path from C to H

C->D->E->F->G->H

Graph: C->D, B->A, B->C, B->A, A->B; Query: Path from B to C

B->C

Graph: A->B, H->I, G->H, E->F, D->E, C->D, H->B, C->H, D->E, F->G, B->C; Query: Path from D to D

D

Graph: D->E, F->G, E->F, B->C, C->D, C->A, A->B; Query: Path from E to C

No path exists

Graph: A->B, C->D, D->E, B->C, C->A, D->A; Query: Path from C to C

C

Graph: C->D, A->D, B->C, D->E, A->B; Query: Path from C to B

No path exists

Graph: F->G, C->A, E->I, A->B, G->H, C->D, I->J, D->E, H->I, C->E, E->F, B->C, J->F; Query: Path from D to D

D

Graph: B->C, A->B, B->C; Query: Path from A to C

A->B->C

Graph: C->D, B->C, G->H, A->B, H->I, G->B, F->G, D->E, F->G, E->F, G->H; Query: Path from A to E

A->B->C->D->E

Graph: J->C, H->I, H->J, A->B, B->C, F->G, G->H, I->J, D->E, C->D, E->F; Query: Path from C to G

C->D->E->F->G

Graph: G->H, H->I, A->B, D->E, F->H, F->G, E->F, B->C, A->B, C->D; Query: Path from D to A

No path exists

Graph: B->C, A->B, D->B, C->D; Query: Path from D to A

No path exists

Graph: C->D, B->J, B->C, E->H, F->G, G->H, E->F, A->B, D->E, I->J, B->J, F->A, H->I; Query: Path from J to C

No path exists

Graph: B->C, C->D, D->E, C->B, F->G, E->F, F->B, H->I, G->E, I->C, A->B, G->H; Query: Path from C to C

C

Graph: B->C, B->A, A->B; Query: Path from C to A

No path exists

Graph: C->D, B->C, D->E, E->C, A->B; Query: Path from C to E

C->D->E

Graph: C->A, B->C, A->B, D->E, C->D, A->B; Query: Path from C to E

C->D->E

Graph: B->F, A->B, F->G, E->F, G->H, C->D, B->C, D->E, A->B; Query: Path from F to E

No path exists

Graph: C->D, A->B, A->C, D->E, B->C, C->D; Query: Path from C to D

C->D

Graph: A->C, A->B, D->E, C->D, B->C; Query: Path from D to B

No path exists

Graph: D->E, E->A, B->F, E->F, C->D, A->B, G->A, F->G, B->C, G->H, D->A; Query: Path from D to E

D->E

Graph: B->A, A->B, B->C; Query: Path from A to A

A

Graph: G->D, C->D, D->E, B->C, F->G, A->B, A->E, C->F, E->F; Query: Path from B to C

B->C

Graph: G->E, C->D, E->F, H->I, B->C, C->E, A->C, G->H, D->E, F->G, C->I, A->B; Query: Path from I to E

No path exists

Graph: G->B, E->F, B->C, D->E, C->D, A->B, F->G, E->F; Query: Path from F to A

No path exists

Graph: C->D, B->C, A->D, A->B; Query: Path from D to A

No path exists

Graph: E->F, B->C, C->D, H->I, H->I, F->G, I->B, D->E, A->B, G->H; Query: Path from D to I

D->E->F->G->H->I

Graph: B->C, A->C, A->B; Query: Path from B to A

No path exists

Graph: G->D, E->F, D->E, F->G, A->B, C->D, B->C, G->H; Query: Path from B to E

B->C->D->E

Graph: D->E, F->G, B->A, A->B, E->F, C->D, B->C, C->G; Query: Path from A to C

A->B->C

Graph: B->C, A->B, B->C; Query: Path from A to B

A->B

Graph: C->A, A->D, C->D, A->B, B->C, D->E; Query: Path from D to A

No path exists

Graph: E->F, B->C, A->B, C->E, F->G, I->J, C->D, G->H, H->I, D->E; Query: Path from B to H

B->C->D->E->F->G->H

Graph: G->A, G->H, E->F, H->I, I->J, A->B, C->D, C->F, B->C, D->E, F->G; Query: Path from A to C

A->B->C

Graph: A->B, C->D, F->C, B->C, A->D, E->F, D->E; Query: Path from E to F

E->F

Graph: D->E, E->F, A->C, H->I, B->C, B->I, G->H, A->B, F->G, C->D; Query: Path from G to A

No path exists

Graph: E->I, A->B, C->D, G->H, H->B, H->I, F->G, C->I, G->D, B->C, E->F, D->E; Query: Path from I to C

No path exists

Graph: E->F, B->A, B->D, D->E, F->B, B->C, C->D, A->B; Query: Path from A to A

A

Graph: D->I, H->I, D->E, H->A, F->G, F->G, C->D, B->C, E->F, A->B, G->H, I->E; Query: Path from D to F

D->E->F

Graph: A->C, B->C, A->B; Query: Path from A to B

A->B

Graph: G->H, C->D, D->E, H->I, J->B, A->B, G->C, I->J, B->C, E->F, E->H, F->G; Query: Path from F to J

F->G->C->D->E->H->I->J

Graph: G->A, E->B, D->E, A->B, E->F, G->H, F->G, C->D, B->C; Query: Path from D to H

D->E->F->G->H