lamm-mit/synthetic_graph_pathfinding · Datasets at Hugging Face

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

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

A->C

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

B

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

C->A

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

B->C

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

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

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

No path exists

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

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

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

No path exists

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

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

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

No path exists

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

A

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

E

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

No path exists

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

No path exists

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

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

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

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

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

No path exists

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

D->G->H

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

G->D

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

E->F->G->H

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

No path exists

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

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

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

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

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

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

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

D->E->F

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

F->G->H

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

C->A

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

A

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

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

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

B->C->A

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

H

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

No path exists

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

D->E->F

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

B

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

C

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

No path exists

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

C->D

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

A->B

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

No path exists

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

No path exists

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

No path exists

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

D->A->B->C

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

A->B->C

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

No path exists

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

No path exists

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

D->F

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

A->C->F->G

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

G->B

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

H->I->J

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

A

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

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

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

No path exists

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

B->C->D->E

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

No path exists

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

B

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

No path exists

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

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

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

No path exists

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

A->B->C->D

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

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

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

No path exists

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

C->D->E->F

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

B->C->D->E

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

A->B

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

A->B->C

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

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

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

No path exists

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

No path exists

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

I->J->A->B->C->D

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

A

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

G->H

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

B

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

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

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

D

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

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

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

No path exists

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

B->C->D->E

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

A->B

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

No path exists

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

E->A->G

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

C->D

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

B

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

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

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

H->I->C->D->E

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

D->E->F

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

C

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

G->H->I

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

C->D

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

D

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

B->C

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

A->B->C->D

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

C

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

B->C->D

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

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

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

B

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

A

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

No path exists

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

D->F->E

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

H

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

No path exists