lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B->C

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

No path exists

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

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

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

No path exists

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

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

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

A->B->C->D

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

B

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

B->C->D->E

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

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

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

No path exists

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

E

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

B

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

C

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

D

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

B->C->D

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

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

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

No path exists

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

No path exists

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

H

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

No path exists

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

A->B

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

No path exists

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

B

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

D

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

D

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

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

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

B->A

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

G->H->F

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

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

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

A->B->C

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

F

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

No path exists

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

G

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

No path exists

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

A->C

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

B->C

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

A->B->C

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

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

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

No path exists

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

No path exists

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

No path exists

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

E

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

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

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

D->E

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

F->G->H->I->J

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

No path exists

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

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

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

No path exists

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

No path exists

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

No path exists

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

F->A->B->C

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

B->C

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

C->I

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

H

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

No path exists

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

H

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

No path exists

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

No path exists

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

No path exists

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

F->G

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

E->F

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

C->D->E

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

B->C

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

A->C

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

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

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

B->A

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

F->G->H

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

F->C->D->E

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

B->C->A

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

No path exists

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

No path exists

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

A->B

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

No path exists

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

No path exists

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

No path exists

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

D->A->B

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

No path exists

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

E

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

A->B

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

A->B->D

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

No path exists

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

C->A->B

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

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

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

No path exists

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

B->C->D

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

No path exists

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

B->C

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

A

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

D

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

C

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

E->F

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

E->C->D

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

B->C

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

D->E->B->C

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

No path exists

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

No path exists