lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

D

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

No path exists

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

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

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

A->B->C

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

C

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

E

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

No path exists

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

D

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

A->B

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

G->H->I

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

B

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

B->C

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

D->E->F->G

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

E

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

F

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

No path exists

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

C

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

B

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

D->E

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

B->C

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

A->B->C

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

C

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

C->D->E

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

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

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

A->B->C->D

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

B->A

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

C->D->E->F

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

E->F->G->H

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

No path exists

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

No path exists

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

C

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

C->D->E

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

A

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

No path exists

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

No path exists

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

D->E->B->C

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

No path exists

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

No path exists

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

E->A

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

No path exists

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

No path exists

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

A

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

B

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

C->D

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

No path exists

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

F->G->H->E

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

No path exists

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

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

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

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

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

D->E->B->C

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

D->E->F->G

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

A

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

A

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

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

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

No path exists

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

No path exists

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

A->B->C

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

C

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

D->E

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

C->A

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

E->F->G

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

No path exists

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

A->B

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

No path exists

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

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

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

I

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

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

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

B

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

No path exists

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

A->B->C->D

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

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

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

No path exists

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

No path exists

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

B->C

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

D->E->F

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

C

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

No path exists

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

B

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

D->E->B->C

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

B->C->F

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

B->C

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

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

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

No path exists

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

A->B->C

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

H->B->C->D->E

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

No path exists

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

No path exists

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

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

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

E->F

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

C->D

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

No path exists

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

No path exists

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

No path exists

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

E->F

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

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

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

No path exists

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

No path exists

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

A

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

A->B->C

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

B->C