lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

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

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

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

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

D->E->F

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

D->E->F->G

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

B->C->D

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

C->D

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

G

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

No path exists

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

A->B->C

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

No path exists

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

A->B->C

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

I->D

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

C

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

A->B->C

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

G

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

A->B->C

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

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

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

B

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

No path exists

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

E->F->G->H

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

G->H->I->B

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

D->A

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

B->C

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

E->A->D->B

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

B

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

No path exists

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

No path exists

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

No path exists

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

D->F

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

E->F

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

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

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

No path exists

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

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

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

No path exists

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

C

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

No path exists

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

A->B

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

C->D

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

No path exists

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

A->B

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

D->E->B->C

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

F->G->H->I

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

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

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

No path exists

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

C->D->E

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

No path exists

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

B

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

A->B->C

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

No path exists

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

E->D

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

No path exists

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

No path exists

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

C->D->A->B

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

B->C->D

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

E->F->G->H

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

A->B->C

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

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

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

No path exists

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

D

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

E->D->B

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

D->C->A->B

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

F

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

No path exists

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

A->B

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

C

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

E->F->G

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

A->B

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

C->D

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

No path exists

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

C->D

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

No path exists

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

No path exists

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

No path exists

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

C

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

G

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

No path exists

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

F

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

C->D->E

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

C

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

A->B->C

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

A->B

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

B

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

F->C->D

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

G->H->I

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

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

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

No path exists

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

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

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

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

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

No path exists

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

No path exists

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

C->D->E

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

No path exists

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

D->A

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

No path exists

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

D->E

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

No path exists