lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B->C

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

No path exists

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

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

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

C

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

F

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

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

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

H

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

D->E->H->I->J

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

F->A->B

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

H->I

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

No path exists

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

No path exists

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

B->C->D

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

No path exists

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

D

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

No path exists

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

B->D->E->F

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

E->C

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

B

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

No path exists

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

B->C

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

A

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

C->B

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

A->B->C

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

No path exists

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

D->B

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

No path exists

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

No path exists

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

A->B

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

F

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

C

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

No path exists

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

F

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

A->B

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

C->B

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

D->E->F->G

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

No path exists

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

D->E->F->G

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

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

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

C

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

A

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

No path exists

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

B->C->D->E

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

F->G

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

B->C->D

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

No path exists

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

A

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

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

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

A->B->C

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

No path exists

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

No path exists

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

G->H

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

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

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

A

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

A->B->C

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

No path exists

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

No path exists

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

No path exists

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

B->A

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

C

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

C->D

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

No path exists

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

E->F->G->A

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

B->C->D

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

No path exists

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

H->F->E

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

F->A->B

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

A->B->C

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

E

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

No path exists

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

G

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

D->E->F->G

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

F->G->H

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

No path exists

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

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

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

No path exists

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

B->C->A

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

A

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

E->F

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

D->B->C

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

H->I->A->B->C

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

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

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

C

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

C->D

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

B->C->D

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

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

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

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

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

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

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

A->F

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

G->H

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

C->D

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

No path exists

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

G

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

G->H->I->J

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

A->B->C