Abstract: Proposed side one kind of better assignment the capacity method, namely is not assigns a same constant value for each, but is comes the dynamic assignment different on the other hand value for different on the one hand based on the information importance, the good solution maximal-flow algorithm discovers in the web mass organization the subject drifting question.

Key words: web community, hyperlinks, maximal-flow

摘要： 提出了一种更好的分配边容量的方法，即不是给每条边分配一个相同的常量值，而是为不同的边依据信息的重要度来动态的分配不同的边值，较好的解决最大流算法发现web社团中的主题漂移问题。

关键词: web社团, 超链接, 最大流