Hello to everybody,
I'm preparing for a competition in Informatics and I had difficulty with the following task:
You should find a path with the greatest number of points(vertices) in a graph.
/The graph has no cycles in it - it's a tree./
Can you write down the code or explain to me how to do it?
Thank you in advance!
Draw a few simple trees on paper.
Draw on them what the longest path would be, say using a highlighter.
Think about the process you go through to work that out, then think about how you might code it.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
