lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

No path exists

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

B

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

B->C->A

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

No path exists

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

F

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

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

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

D->E

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

E

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

F->G->H->I

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

A->B

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

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

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

No path exists

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

A

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

E->F

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

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

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

D->E

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

A

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

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

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

No path exists

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

No path exists

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

G->H->I

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

No path exists

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

B

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

B->C

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

B->A

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

No path exists

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

No path exists

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

C->D->E

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

F->G

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

B

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

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

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

A->B->C->D

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

No path exists

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

No path exists

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

D

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

No path exists

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

C->A

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

D->B->C

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

No path exists

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

A->B->C

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

F->B->C->D

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

J

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

B

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

No path exists

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

B->C->D

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

A->B

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

A->B

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

No path exists

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

No path exists

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

D

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

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

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

No path exists

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

No path exists

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

C->D->E

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

E->F->A->B

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

E->F

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

B->C->A

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

C->D->E->G->H

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

F->A->B

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

C->F->G

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

C->D->E

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

No path exists

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

E->B

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

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

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

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

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

No path exists

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

A->B->C

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

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

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

No path exists

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

A->C

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

B->C

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

B->C->D

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

No path exists

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

No path exists

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

B->C->D

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

F->G

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

No path exists

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

No path exists

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

No path exists

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

C->D

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

B

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

No path exists

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

A

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

No path exists

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

B

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

C->D->E

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

No path exists

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

E

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

No path exists

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

B->C

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

G->H->A

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

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

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

No path exists

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

F

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

D->E

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

No path exists

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

D

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

A->B

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

A->B

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

A->B->C