How do I find paths that traverse all edges in a graph of vertices and edges where some edges are directed and some aren't? I want the minimum number of paths that will cover the graph.
I know about Heirholtz's algorithm and I know how to apply it to a graph that has only directed edges or only undirected edges. But I don't know how to do it on a graph that has both types of edges.
