lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B->C->D

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

A->B->C->D

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

B->C->D->E

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

C->D->E->B

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

C->G

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

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

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

F

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

F

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

B

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

B->C

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

A

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

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

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

A

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

B->C->D->E

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

A->B->C

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

A

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

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

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

B->C

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

A->B

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

A->B

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

B

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

C->E->F->B

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

No path exists

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

E->F->G

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

B->C->D

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

No path exists

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

A

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

A

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

No path exists

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

E->F->G->H

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

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

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

No path exists

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

E->F->G

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

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

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

C->B

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

F->G

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

D

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

No path exists

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

No path exists

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

A->B

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

I

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

No path exists

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

No path exists

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

E

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

No path exists

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

No path exists

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

A->B->C

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

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

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

A->E

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

No path exists

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

No path exists

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

C->A->B

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

No path exists

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

A->B->C->E

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

No path exists

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

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

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

No path exists

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

C->D

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

C->D

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

A

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

No path exists

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

B->C->D

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

E->F->G->H

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

No path exists

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

C->D->E

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

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

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

F->B

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

A->C

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

D->E

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

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

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

No path exists

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

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

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

A

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

A->B

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

E->F->G

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

A->B->C->D

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

A->B->C

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

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

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

A

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

No path exists

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

No path exists

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

A->B

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

C

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

No path exists

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

C->A

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

No path exists

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

F

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

D->E->F->I

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

C->D

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

No path exists

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

C->D