lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

G->H->I->J

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

F->C->D->E

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

A->B->C

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

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

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

No path exists

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

G

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

No path exists

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

B

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

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

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

B->C->D

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

E->F

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

D->E->F

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

D->E

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

A->B->C

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

B->C->D->A

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

No path exists

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

D->E

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

A->B

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

C

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

No path exists

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

A->B

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

No path exists

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

B

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

No path exists

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

D->E

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

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

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

D->E->F->G

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

A->B

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

F->G->H

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

C->D

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

B

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

C->E

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

No path exists

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

B->C

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

A->B

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

D->C

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

B

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

No path exists

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

B->C

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

D

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

No path exists

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

E->F->G

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

No path exists

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

B

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

A

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

B->C

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

No path exists

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

J

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

A->B->C->D

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

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

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

I->E->F->G

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

No path exists

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

No path exists

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

No path exists

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

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

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

C->D

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

A->B->C

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

C

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

H->F->G

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

No path exists

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

B->C->D

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

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

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

C->A->B

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

A->B

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

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

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

No path exists

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

A->B->C

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

I->C->D->E->F

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

B->C->D->E

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

G

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

No path exists

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

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

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

B->C

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

A

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

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

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

H->I

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

A->B->C

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

D->E->F

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

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

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

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

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

No path exists

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

D->E

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

No path exists

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

No path exists

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

No path exists

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

E

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

D

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

A->B->C->D

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

No path exists

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

No path exists

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

D->E

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

B->C->D

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

No path exists

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

F->G->H->I

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

No path exists

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

G->D