The class of problems reducible in L to the problem of whether an undirected graph has a unique connected component.
See [AG00] for more information.
The corresponding class for directed graphs equals NL. On the other hand, none of that class's corresponding search problems are obviously FNL-hard.
[Tor00] showed the following problem complete for coUCC under L reductions: