title: Minimal path - all edges at least once
body: <p>I have directed graph with lot of cycles, probably strongly connected, and I need to get a minimal cycle from it. I mean I need to get cycle, which is the shortest cycle in graph, and every edge is covered at least once.</p>
  
  <p>I have been searching for some algorithm or some theoretical background, but only thing I have found is Chinese postman algorithm. But this solution is not for directed graph.</p>
  
  <p>Can anybody help me? Thanks</p>
  
  <p>Edit>> All edges of that graph have the same cost - for instance 1</p>