lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

No path exists

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

No path exists

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

No path exists

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

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

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

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

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

No path exists

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

F

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

H->I->B->C

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

A->B->C->D

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

No path exists

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

No path exists

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

No path exists

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

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

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

No path exists

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

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

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

E->B->C

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

H->A

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

A->B

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

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

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

B->C

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

B->C

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

B

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

No path exists

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

B->C

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

B

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

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

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

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

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

B

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

A->B->C->D

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

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

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

C->D

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

B

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

A->B

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

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

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

D->E->F

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

C

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

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

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

A->B

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

C

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

F->G->H->A

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

No path exists

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

No path exists

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

A->B->C

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

I->D->E

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

No path exists

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

No path exists

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

C->D->E

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

B->C->G

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

G->H

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

No path exists

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

A->B

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

E->F

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

No path exists

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

A

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

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

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

A->B

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

D->B

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

E->F->G

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

No path exists

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

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

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

No path exists

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

C->F->G->H->I

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

A->B->C

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

C->D->E

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

B

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

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

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

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

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

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

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

B->C

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

No path exists

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

C

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

B

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

D->E->F

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

E->F->I->J->A

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

F

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

No path exists

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

No path exists

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

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

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

No path exists

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

No path exists

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

No path exists

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

C->D->A->B

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

No path exists

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

A->B

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

A->C

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

No path exists

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

C->D->E->F

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

B

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

No path exists

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

D->E->B->C

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

No path exists

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

B

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

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

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

B

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

No path exists