Design an algorithm based on depth-first search to determine if a graph is bipartite and 

if it is not return an odd length cycle in the graph. Your algorithm should use the 

adjacency list representation of a graph. Your algorithm should run in linear time.