Complexity and hardness of undirected path
The undirected version of PATH, usually known as USTCON, is in L due to Reingold's theorem.

USTCON is trivially complete for L with respect to logspace reductions. I don't know if it is L-complete with respect to weaker reductions such as $\mathsf{AC}^0$ reductions; see this question.