Given this graph:

And given the $1-8$ walk $$C_1=(1,3,2,3,4,5,3,6,7,6,8),$$ find a $1-8$ path. Note: trails do not repeat edges, paths do not repeat vertices.
Lastly, given this closed odd-length walk $$C_2=(1,3,6,5,3,4,5,6,8,7,6,3,2,1),$$ find an odd cycle (a cycle is a closed path).
I am completely lost, and I seem to find it very difficult to obtain proper references on the required algorithms, mostly due to notation differences in textbooks and internet resources, arising from the different usages authors attribute to "path", "trail", "circuit", and "walk".
Thanks in advance.
Given a walk, just remove all cycles in it and you are left with a path. By cycles, I mean you can always replace $$a,a_1,a_2,\dots, a_n, a, b$$ with $a,b$.