We are given an undirected, unweighted graph and a non-negative integer K.
- We have to determine if there exists a simple path of length at least K in the graph
- A simple path is a path that does not have any repeated vertices
- The length of a path is defined as the number of edges in the path 