I have to identify the longest path of a connected, undirected graph $G=(V,E)$, but I'm currently stuck.
Out of intuition I would say that the longest path in G is $G=|V-1|$ but that doesn't seem to work with every graph.
Happy for any pointers into the right direction.
Sorry for the confusion. I was talking about a connected graph. Wrong translation from my mothertongue.