Borj's algorithm for iterating over simple paths on a graph

Question

Algorithms

As part of the work on the coursework, you need to find out what it is. The search engines in unison suggest looking for "Berzh" instead of "Borzh".
In the book of C. Berge "Graph Theory and Its Applications" this issue is not directly addressed. Perhaps you should look in later publications.
Can someone tell me where you can find a detailed description of the algorithm?

Answer 1

I have not heard of such an algorithm. And for the described task, it hardly exists. The point is that enumeration of all simple paths (in which no vertex occurs twice) between any two vertices in a general graph is an NP-complete problem. Apart from the brute force method, no solution has yet been found.

Answer 2

You can look here if it suits www.e-maxx.ru/algo/
But it’s not a fact that there is exactly the algorithm that you are looking for