Cover Time of Directed Graphs Posted by Shiva Kintali, at cstheory.stackexchange.com, 12 Nov 2010 Given a random walk on a graph the cover time is the first time (expected number of steps) that every vertex has been hit (covere…