lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

A->B->C->D

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

A

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

No path exists

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

A

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

B

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

C->D->F->B

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

G

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

No path exists

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

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

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

No path exists

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

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

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

G->H->I

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

A->B->E

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

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

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

No path exists

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

A->B->C

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

E

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

D->A->B->C

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

C

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

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

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

E

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

E

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

A->B

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

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

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

D->E

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

A

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

No path exists

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

C->D

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

No path exists

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

B->A

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

E

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

D

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

No path exists

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

E->F->G->H

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

C

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

A

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

No path exists

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

B->C->D->E

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

B->C

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

F->G

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

E->F->G

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

No path exists

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

B

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

No path exists

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

No path exists

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

E

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

B

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

No path exists

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

F

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

No path exists

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

No path exists

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

B->C

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

No path exists

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

G->H->C

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

D

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

A->B

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

No path exists

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

D->E->B

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

No path exists

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

E->F

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

No path exists

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

E->F

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

F->G

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

B->C->D

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

A->B->C->D

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

B->C->D->E

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

B

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

C

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

A->D->B->C

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

A->B

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

No path exists

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

No path exists

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

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

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

No path exists

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

C

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

B->A

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

C

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

C->A->B

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

B->C

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

C->D->A->B

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

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

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

A->B

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

E->F->G

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

No path exists

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

D->E->F

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

No path exists

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

No path exists

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

B->A

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

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

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

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

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

D->E

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

H->E->F->A->B

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

C

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

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

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

No path exists

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

C->B