lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B

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

C->D

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

A

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

No path exists

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

No path exists

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

A

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

No path exists

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

B->C

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

No path exists

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

A

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

A->B->C->D

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

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

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

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

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

No path exists

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

A

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

B->C->D

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

No path exists

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

D

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

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

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

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

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

A->B->C->D

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

No path exists

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

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

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

No path exists

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

A

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

I->A

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

A->B->C

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

A->B

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

D->E

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

C->D->B

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

No path exists

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

B->C

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

No path exists

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

No path exists

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

A->B->C->D

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

C->D

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

B->C->D->E

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

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

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

D->A

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

A->B->C->D

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

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

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

No path exists

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

A->B

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

C->D

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

D

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

F->G->D

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

A->B

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

No path exists

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

C

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

D->B->C

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

C->D->B

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

C

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

C->D

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

C

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

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

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

E->A

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

No path exists

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

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

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

G->H->C

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

F->G->A

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

No path exists

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

A->B->C

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

B->C->D

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

D->E

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

No path exists

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

G->H->I->E

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

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

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

J

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

D

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

No path exists

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

B->C

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

No path exists

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

B->C

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

D->E->F

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

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

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

No path exists

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

C->D->E

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

No path exists

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

C->D->E->F

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

D->E

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

B

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

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

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

C

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

A->B

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

C->D

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

C->D

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

B->C->D->E

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

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

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

No path exists

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

No path exists

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

A->B->C

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

No path exists

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

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

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

B

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

A->B