Find minimal number of journeys (start and finish in one node; with given maximal effort) to visit every edge of a graph