I am trying to find an algorithm or a way to find paths in a directed graph to visit all edges exactly once with minimum number of paths possible. Then, print the results found.
For example in this graph, the minimum number of paths to cover all edges exactly once is 2 that are ( 1 → 3 → 4 → 3 → 2 ) and ( 1 → 2 )
