lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B

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

C

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

C->D

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

B

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

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

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

C->D->A->B

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

A->B

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

E

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

D->B

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

No path exists

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

A->B->C

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

No path exists

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

C->D->G->H

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

No path exists

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

C->A

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

No path exists

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

No path exists

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

A->B->C

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

No path exists

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

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

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

B->C

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

G->H->D->B

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

No path exists

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

B->C

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

A

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

No path exists

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

D

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

C->D

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

A

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

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

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

G

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

B->C

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

D

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

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

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

D->E->F

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

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

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

C->D

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

No path exists

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

No path exists

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

E->F

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

No path exists

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

A->B

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

G->A->B->C->D

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

C->D

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

C->A

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

B->C

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

D->E->F->G

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

D

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

No path exists

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

F->G

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

No path exists

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

B->A

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

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

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

No path exists

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

C

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

No path exists

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

No path exists

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

D->A

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

B->C->F->G

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

No path exists

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

C->A->B

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

A

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

No path exists

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

No path exists

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

No path exists

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

C

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

E

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

No path exists

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

C->A

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

B

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

C->D->E->F

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

No path exists

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

C

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

No path exists

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

C->D->E->F

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

C->D->E

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

No path exists

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

No path exists

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

A

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

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

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

B

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

No path exists

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

D->E->F

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

E

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

D->A

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

A->B

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

B->C

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

No path exists

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

No path exists

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

B->C

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

A

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

No path exists

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

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

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

F->C

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

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

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

B->C

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

A

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

C->D

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

No path exists

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

No path exists