'Algorithm for finding shortest directed odd circuit in a digraph
I am trying to find an algorithm for finding shortest directed odd circuit in a digraph. I would use breadth-first-search, but I don't know how to find odd cycles. How can I do this?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|