lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

D

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

C

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

B->A

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

No path exists

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

D->E->F->C

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

A->G->H

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

No path exists

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

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

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

E->D

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

E->F

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

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

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

No path exists

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

D->E->F

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

A->B

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

A->B

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

No path exists

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

No path exists

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

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

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

D

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

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

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

C

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

D->E

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

A->B->C

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

C

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

B

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

H

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

No path exists

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

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

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

D->E

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

D

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

B->A

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

No path exists

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

A->B->C

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

No path exists

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

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

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

No path exists

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

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

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

No path exists

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

C

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

D->E->F

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

B->A

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

No path exists

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

No path exists

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

C

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

B

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

B->C->D

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

F

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

No path exists

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

B->C->D->E

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

No path exists

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

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

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

C->D

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

No path exists

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

B

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

C->B

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

No path exists

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

D->E->F

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

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

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

A->B->C->D

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

C->D

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

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

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

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

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

No path exists

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

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

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

B

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

No path exists

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

D->E

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

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

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

No path exists

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

C->D->E

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

B

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

D->E

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

D->E->F->G

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

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

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

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

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

No path exists

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

A->B

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

B->C->D->E

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

A->B->C

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

A

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

B->C->D->A

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

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

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

A->B->C->D

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

No path exists

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

C

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

A

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

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

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

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

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

D

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

A->B

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

A->B->C

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

No path exists

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

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

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

A->B->C->D

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

No path exists

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

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