lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

A->B->C->D

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

F->G

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

A->B->C->D

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

H->C->F

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

No path exists

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

C->D

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

No path exists

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

E

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

D

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

E

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

D->E->F

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

No path exists

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

E->F

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

C->D

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

A->B->C

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

A->B

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

I

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

A->D

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

H->I->C->D->E

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

B->D

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

D->E->A->B

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

F->G

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

B->E

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

B

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

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

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

H

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

No path exists

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

A->B->C

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

A

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

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

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

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

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

A->B

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

No path exists

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

A->B->C

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

B

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

B->C->D

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

B

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

C->A->B

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

E->B->C

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

D->E->F

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

C->D->E

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

No path exists

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

B->A

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

C->A

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

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

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

G

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

I->J

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

B->C->D

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

B

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

No path exists

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

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

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

A

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

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

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

No path exists

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

A->B

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

No path exists

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

C->D->A

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

D->E->F

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

C->D->E

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

D->E->B->C

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

A->B

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

G->H->I->J

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

B->C

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

A->B->C

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

No path exists

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

No path exists

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

A->B->C->D

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

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

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

G

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

E->A

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

D->E->F

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

F

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

C->D->E

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

C->D->E

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

B->C

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

B->C->D

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

No path exists

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

A->B

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

No path exists

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

D->E->F->G

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

No path exists

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

A->B

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

A->B

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

No path exists

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

E

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

B->A

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

B->A

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

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

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

D

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

No path exists

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

No path exists

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

No path exists

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

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

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

C->A->B

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

A->B->C