lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

No path exists

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

A

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

C->D

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

B->C->D->A

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

No path exists

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

D->E->F

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

A->B

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

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

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

No path exists

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

C->D->E

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

B->C->D

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

C->D

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

No path exists

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

B->C

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

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

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

A->B

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

No path exists

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

No path exists

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

F

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

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

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

No path exists

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

G->B->C

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

No path exists

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

No path exists

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

A->B

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

C->B

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

C->A

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

B

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

A->B->C

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

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

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

No path exists

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

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

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

B->C->D

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

C

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

D

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

C->D->E

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

E->F->G

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

B->C->D

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

A->B->C

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

No path exists

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

A->B

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

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

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

No path exists

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

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

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

No path exists

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

B

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

No path exists

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

A

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

F->B

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

A

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

A

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

A

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

No path exists

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

A

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

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

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

A->B

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

G->E

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

No path exists

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

F->G

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

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

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

A

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

I

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

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

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

No path exists

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

No path exists

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

No path exists

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

F

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

G->H->A->B->C

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

B->C->D->E

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

A

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

No path exists

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

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

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

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

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

C

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

C->D

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

D->E->F

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

B

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

A->B

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

C->D->E

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

No path exists

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

No path exists

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

A->B->C

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

A->B->C->D

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

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

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

No path exists

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

B

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

B

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

F

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

F

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

No path exists

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

C->D

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

A

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

F->I

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

No path exists

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

D

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

C

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

No path exists

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

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

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

B->C->D

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

No path exists