I have a problem finding a strongly connected component of size exactly K in a Tournament Graph. Can someone help me?

Edit: sorry. it's double post.

hm.. I don't want to waste this blog, so I put another variation of this task.

Given an undirected graph, find a cycle of size exactly K