lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

No path exists

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

No path exists

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

I->C->D->E

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

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

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

No path exists

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

B->C->D

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

B->C

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

B->C

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

B

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

E->F

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

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

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

B->C->D->E

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

No path exists

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

B->C

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

No path exists

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

C

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

E

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

No path exists

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

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

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

C->D

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

D->E

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

B->C

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

No path exists

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

F

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

No path exists

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

D

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

F->A->B->C

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

No path exists

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

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

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

E->F->G->A

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

A->B->C->D

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

No path exists

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

D->E->B->C

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

B

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

A->B

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

C->D->B

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

A->B->C

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

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

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

B->C

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

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

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

B->C->F->G

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

C

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

C

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

No path exists

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

No path exists

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

C->D

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

C

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

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

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

D->E->F->G

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

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

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

No path exists

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

A->B->C

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

A

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

No path exists

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

No path exists

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

D

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

D

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

No path exists

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

No path exists

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

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

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

B->C->D

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

No path exists

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

No path exists

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

C

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

C

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

No path exists

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

E->F

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

A->B->C

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

No path exists

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

No path exists

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

C->D->A->B

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

C->A

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

A->E

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

A

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

F->C->D

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

D->E->F->G

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

No path exists

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

B->C

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

C

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

B->C

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

D

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

No path exists

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

C->D

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

A->B

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

B->C

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

No path exists

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

C->A->B

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

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

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

No path exists

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

C

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

A

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

E->F