How do I find the given path between two vertexes with non-deterministic algorithm?

Question

There is a cyclic graph with nodes N and edges E. I have a beginning node and ending node and I need to find all possible paths of length K