Abstract: HITS is one of the classical link analysis algorithms，the main problem of it is the topic drift.In this paper，a new algorithm：MCHITS，which is based on maximal flow algorithm is prososed.It performs the expansion from root twice thus including pages which are link-distance two or less from at least one page in the root set，then by maximal flow-minimal cut algorithm finding a community that takes root set as the center，the pages in the community as MC-base set，The experimental results show that based on the MC-base，the iterative computation of Hits has a big improvement about the results，decreases the probability of the topic drift.