> Is there a good algorithm to find the maximum loop in a
> graph which satisfy the problem's requirement?
> I think it may be a NP complete problem.