lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

D->A->B->C

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

No path exists

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

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

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

D->E

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

No path exists

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

No path exists

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

B->C

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

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

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

A->B->C

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

D->E->F

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

No path exists

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

I

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

No path exists

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

D

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

No path exists

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

D->E

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

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

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

B

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

B

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

C->D->E->F

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

A->E->C->D

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

No path exists

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

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

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

No path exists

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

E->G

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

E

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

B

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

A->B->C

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

No path exists

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

B

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

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

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

B

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

B->C

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

F

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

No path exists

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

D

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

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

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

No path exists

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

No path exists

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

B->D

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

D->E->A

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

No path exists

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

E->F->G

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

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

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

No path exists

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

E->C->D->F

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

D->E

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

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

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

No path exists

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

A->B->C->D

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

B->C

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

B->C->D

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

A->B

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

No path exists

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

B->C

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

A->B

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

C->D

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

A

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

A

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

No path exists

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

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

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

A->B

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

B

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

B->C

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

G->H->I

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

No path exists

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

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

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

C->D

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

A->B->C->D

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

A->B->C

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

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

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

No path exists

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

E->F->G->H

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

No path exists

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

E->F

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

D

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

E

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

No path exists

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

C->A->B

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

D->E->F->G

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

B

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

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

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

B->C->D

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

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

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

A->B

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

B->C->D

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

A->B

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

No path exists

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

E->F

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

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

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

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