What's a proper algorithm to count all possible paths from any given vertex to another in a graph?

Question

I\'m working with graphs and I\'d like to count all possible paths from given vertex X to given vertex Y.

This is the algorithm I\'ve come up with:

cla