lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

C->D

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

B->C

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

D->E

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

No path exists

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

D->E->F

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

No path exists

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

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

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

G->H->I->F

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

B->C->D

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

E->F

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

F->G

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

H->I->J

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

A->B->C->D

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

E

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

H->C

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

No path exists

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

B

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

D->E->F

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

E->F

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

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

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

F->D

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

B->C->D

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

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

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

No path exists

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

B

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

A

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

No path exists

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

No path exists

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

No path exists

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

No path exists

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

B->C->D

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

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

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

No path exists

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

B

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

G->C->D

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

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

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

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

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

No path exists

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

C

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

B

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

A

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

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

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

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

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

D

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

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

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

C->D

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

E

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

A->B->F->G->H

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

H

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

No path exists

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

E->A->B->C

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

A->B

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

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

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

E->F

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

No path exists

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

No path exists

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

B->F->G

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

B

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

F

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

No path exists

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

No path exists

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

C

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

B->C

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

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

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

A->B->C

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

C

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

D->E->F

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

No path exists

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

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

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

D->E->F->G

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

C->D->A->B

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

D->E->F

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

A->B->C

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

No path exists

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

No path exists

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

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

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

A->B

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

C

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

No path exists

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

No path exists

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

A->B->C

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

G->H

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

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

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

A->B->C

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

No path exists

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

C->A

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

D->E->F->A

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

C->D->E->B

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

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

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

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

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

No path exists

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

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

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

E->F->G

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

No path exists

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

A

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

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

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

No path exists

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

No path exists

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

D

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

No path exists