lamm-mit/synthetic_graph_pathfinding_100K · Datasets at Hugging Face

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

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

A->B->C->D

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

A->B->C

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

F

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

J->C->D

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

No path exists

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

B->A

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

C

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

C

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

No path exists

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

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

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

B->C->D

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

F->G

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

C->D

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

No path exists

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

E->F->G

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

C->A

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

E->F->G->C

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

B->H

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

C->A->B

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

C->D

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

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

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

No path exists

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

C->D->E

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

No path exists

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

No path exists

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

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

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

E->J->F->G

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

G->H->A->D

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

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

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

No path exists

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

D->E->F->A

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

No path exists

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

No path exists

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

D->E

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

B

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

No path exists

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

C->D

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

A

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

E

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

No path exists

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

D->C->B

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

No path exists

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

A->B

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

No path exists

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

B

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

D->C

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

B->C->D->E

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

D->E

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

A->B->C

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

E

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

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

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

A->B

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

F

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

B->C

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

No path exists

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

B

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

I->D->E->F->G

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

B->C

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

B

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

C

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

A->B->C->D

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

No path exists

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

No path exists

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

A->B

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

D->B->C

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

No path exists

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

E

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

No path exists

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

E

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

A->B->C

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

A->B->C->E

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

No path exists

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

No path exists

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

D->E->F->G

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

B->C

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

No path exists

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

A

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

C

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

A

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

No path exists

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

B

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

A

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

C->D

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

A->B

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

C

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

No path exists

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

A

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

A->D

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

No path exists

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

F->G->H->B->C

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

No path exists

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

No path exists

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

B->C->D

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

A->B->C

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

F->G

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

I

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

B

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

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

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

No path exists

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

C