5-2.Do a topological sort of the following graph G

This problem is from "The Algorithm Design Manual (2nd Edition)" by Steven Skiena. Since, this graph is not a DAG topological sorting can't be done. In the errata list for this book it is suggested to reverse the edge (F,H) but this will make the vertex "H" unreachable. Then how this solution is possible "A, B, D, E, C, H, G, I, J, F".

`H`

becomes unreachable?