shortest directed odd cycle
- by gleb-pendler
6.1.4 Describe an algorithm based on breadth-first search for finding a shortest
odd cycle in a graph.
6.3.5 Describe an algorithm based on directed breadth-first search for finding a
shortest directed odd cycle in a digraph.
what is most importent is that it must be a directed graph not necessary bfs but must be the shortest directed odd cycle!!!
Question was taken from "Graph Theory" by J.A. Bondy and U.S.R. Murty
thanks in advance!!!