lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

No path exists

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

No path exists

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

C

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

B

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

J

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

B->C

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

A

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

B->C->D->E

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

A->B

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

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

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

C->A->B

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

F

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

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

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

No path exists

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

E->F->G->H

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

B->A

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

I->G

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

F->G

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

A->B->C

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

D->E

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

No path exists

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

C

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

A->B->C

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

C->D->E

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

E->B

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

No path exists

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

B

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

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

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

No path exists

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

A->B

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

No path exists

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

E->A

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

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

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

No path exists

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

B->C

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

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

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

B->C->D

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

No path exists

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

F->G->H

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

I

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

E->F

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

A->B->C

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

D

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

D

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

A->B

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

G->H->I->J->B->C->D

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

B

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

F->G->H->B

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

No path exists

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

C

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

D->E

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

D->E->F

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

D->E

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

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

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

No path exists

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

No path exists

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

D

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

A

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

E

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

B->C->D

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

No path exists

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

No path exists

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

A->B->C

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

No path exists

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

I->J

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

B->C

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

No path exists

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

C->D

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

E->F

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

No path exists

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

No path exists

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

B->C->D

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

No path exists

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

B->C->D->E

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

H->A

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

No path exists

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

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

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

B->A

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

D->E->F->G

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

A->B

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

No path exists

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

F->G->C->D

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

B->D

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

B->C->D->E

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

E

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

C

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

D->A

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

A->C->D->E

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

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

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

B->C

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

D

Graph: F->G, D->E, G->H, H->I, A->B, G->C, E->F, 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 C to B

No path exists

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

No path exists

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

C->D

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

No path exists

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

C->D

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

A->B->C

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

E->F

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

No path exists