lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

B

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

C->D

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

No path exists

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

E

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

No path exists

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

E->F

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

No path exists

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

B->C

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

G

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

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

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

C->D->E->F

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

F->G->A->E

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

B->C->D

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

A->B->C

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

G->H

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

A->B

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

F->B->C

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

H

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

B->C->D

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

C->D

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

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

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

A

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

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

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

No path exists

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

C->D->E->F

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

No path exists

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

H->D->E

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

No path exists

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

D

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

C->D

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

D->E

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

C->D

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

A->B->C->D

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

B->C

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

No path exists

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

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

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

No path exists

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

No path exists

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

No path exists

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

A->B->C->D

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

B->C->D

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

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

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

B->D

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

H->A

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

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

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

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

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

No path exists

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

No path exists

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

B->C

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

B->C

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

No path exists

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

C

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

C->D

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

No path exists

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

A->B

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

No path exists

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

C->D->E->A

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

No path exists

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

No path exists

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

C->D

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

G

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

B->C->D

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

C->B

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

No path exists

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

No path exists

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

No path exists

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

A->B->C

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

B->C->D

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

No path exists

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

No path exists

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

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

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

C->A->B

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

F->A->B

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

No path exists

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

G

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

C->D->E

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

No path exists

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

B->C

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

No path exists

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

C->D->B->A

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

No path exists

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

B->C->D

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

B

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

B->A

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

No path exists

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

No path exists

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

J

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

No path exists

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

No path exists

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

C->D

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

B->F

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

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

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

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

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

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

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

A->B->C->D

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

No path exists

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

No path exists

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

G->H

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

C

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

D->E