lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

G->H->I

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

C

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

A

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

D->E->F

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

B->C->D->E->G

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

No path exists

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

B

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

E->F->G

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

No path exists

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

C

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

A->B

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

No path exists

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

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

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

A->B->C->D

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

C->D

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

No path exists

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

No path exists

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

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

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

No path exists

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

No path exists

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

C->D->E

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

G->I

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

C

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

No path exists

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

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

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

No path exists

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

A

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

G->H->I->A->B

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

C->D

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

D->E

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

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

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

No path exists

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

C->D->E->F

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

No path exists

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

B->C

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

J->A->G->H->I

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

No path exists

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

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

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

A->B

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

No path exists

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

E

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

C->E

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

F->G->H->I

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

F->G->H->I

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

G->H->E->F

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

C->D

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

H->I->D

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

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

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

D->A->B

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

No path exists

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

No path exists

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

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

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

A->C->D

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

A->B->C->D

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

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

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

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

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

No path exists

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

A->B

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

G->H->I->J

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

A->B->C->D

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

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

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

No path exists

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

C

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

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

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

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

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

A

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

C->D

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

B

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

No path exists

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

A->B

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

No path exists

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

A->B->C->E->I

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

B->C

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

No path exists

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

No path exists

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

B->C

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

B

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

C

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

No path exists

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

No path exists

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

C

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

B->C

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

D

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

B->C

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

No path exists

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

A

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

D->E

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

A->B->C

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

C

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

No path exists

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

F->J

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

D->E->H->I->J

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

F->G->E

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

No path exists

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

I

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

C->D

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

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

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

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

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

No path exists

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

I->E->F->G