lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

F->G

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

D

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

B

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

No path exists

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

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

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

No path exists

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

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

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

No path exists

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

B->C->D->A

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

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

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

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

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

No path exists

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

C->D

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

B->C->D

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

D->E

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

No path exists

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

C->D

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

B->C

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

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

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

No path exists

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

No path exists

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

D->E

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

No path exists

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

No path exists

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

C

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

E->D

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

No path exists

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

E->F

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

G->H->C->D

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

D->A

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

No path exists

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

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

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

E->F

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

B->C

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

No path exists

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

No path exists

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

B->C->D

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

No path exists

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

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

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

B->C

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

A->B

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

B->C

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

D->E

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

C

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

E->F->G

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

No path exists

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

No path exists

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

D->A

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

B->A

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

C->B

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

No path exists

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

B->C->A

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

H->E

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

F->G->H->A

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

A->B

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

No path exists

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

No path exists

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

D->A->B

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

C->D

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

D->C

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

No path exists

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

B->C

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

A->B->C->D

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

No path exists

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

B

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

H->I->J

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

C->A->B

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

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

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

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

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

C->D

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

G

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

A->B->C->D

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

B

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

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

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

No path exists

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

F->D

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

C->D

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

No path exists

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

I->B->C->D

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

No path exists

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

J->D->E->F->G

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

No path exists

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

No path exists

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

No path exists

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

E

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

F->C

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

No path exists

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

No path exists

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

A->B->C->D

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

C

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

A->B->C->D