lamm-mit/synthetic_graph_pathfinding_100K · Datasets at Hugging Face

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

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

F

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

C

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

B->C

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

C

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

I->J->A

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

F->G->H->I

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

F->D

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

No path exists

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

No path exists

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

B

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

No path exists

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

A->D

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

D

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

No path exists

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

C

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

E->A->B

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

B

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

No path exists

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

A->B

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

No path exists

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

B->C->D

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

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

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

C

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

No path exists

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

D

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

No path exists

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

No path exists

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

H

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

B->C->D

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

No path exists

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

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

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

No path exists

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

C->D

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

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

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

A->B->C->D

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

No path exists

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

F->A

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

A->B

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

No path exists

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

C

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

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

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

No path exists

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

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

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

A->C

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

F

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

C->D->E->F

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

B->C

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

D->E->F

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

No path exists

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

No path exists

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

F->G

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

A->B

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

A->B->C->D

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

No path exists

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

A->B->C->D

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

No path exists

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

G

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

No path exists

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

No path exists

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

D->E

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

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

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

A

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

E

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

C

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

No path exists

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

F->G

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

A->B

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

No path exists

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

No path exists

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

E

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

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

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

B

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

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

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

No path exists

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

D

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

No path exists

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

C

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

D

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

A->B->C->D

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

No path exists

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

D->E->F->G

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

E

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

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

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

B

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

No path exists

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

E

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

No path exists

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

A->B->C->D

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

No path exists

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

C->D->E

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

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

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

E->F->G

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

C

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

No path exists

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

A->B->C

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

No path exists

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

E->F->G

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

A->B

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

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

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

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