A function that find all simple paths

[i-aki-y]

I recently implemented a julia counterpart of the all_simple_paths function that is originally implemented in the networkX and that finds all simple paths between two nodes in a graph.

Before this work, I searched if there has already existed such a function and found related issues:

#266, #599, #845, #938

Some of them seem to try to make such a function, but now these are inactive.

If my implementation can contribute to the project, let me know, I'd be happy to make PR.

[sbromberger]

@i-aki-y I'd be interested in seeing your code. Mind preparing a PR?

[i-aki-y]

@sbromberger Thank you for your reply. I made PR including some writeup. I would appreciate it if you could review it.