lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B->E->F->D

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

G->H->I->J->E

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

F->G

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

A->B->C->D

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

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

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

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

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

No path exists

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

A->B

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

No path exists

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

F->G->H

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

A->B

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

No path exists

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

B

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

C->B

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

D

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

B->C

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

A->B

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

No path exists

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

J->G

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

A->B->C->D

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

A->B

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

D

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

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

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

C

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

No path exists

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

D->E->F->G

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

G->C->D

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

No path exists

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

No path exists

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

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

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

C->D

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

D->E->F

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

No path exists

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

B

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

A

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

No path exists

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

D->E

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

No path exists

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

No path exists

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

D->E

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

B->C->I

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

C->D

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

B

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

B

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

C

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

D->E

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

A->B->C->D

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

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

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

C->H->I->J

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

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

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

D->E->F->I->J

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

A->B

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

No path exists

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

D->E->C

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

A

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

H->I->J->A->B->C->D->E

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

B->C

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

No path exists

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

B->C

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

D->E->F

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

No path exists

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

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

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

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

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

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

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

No path exists

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

D

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

B

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

A->B->C->D

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

C

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

A->B

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

B->C->D

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

A->B->C->D

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

A->B->C->D

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

B

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

No path exists

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

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

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

No path exists

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

I

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

F->G

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

No path exists

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

No path exists

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

C->D->E

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

No path exists

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

G

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

D->E->F

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

No path exists

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

D->E

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

F

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

D->E->F->G

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

C->D->E

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

D->A->B->C

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

No path exists

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

No path exists

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

C->D

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

D