The　World-Wide　Web　(WWW)　based　on　Internet　services　has　become　a　major　channel　for　information　delivery.　Therefore,　a　scalable　approach　to　support　Internet　searching　is　critical　to　the　success　of　Internet　services.　Actually　Internet　is　a　directed　graph,　webpage　as　node　and　hyperlink　as　edge,　so　the　search　operation　could　be　abstracted　as　a　process　of　traversing　directed　graph.　This　paper　introduces　a　famous　dynamic　Web　search　algorithms,　the　＇fish-search＇,　and　analyzes　its　merits　contrasting　to　general　depth-first　algorithm,　and　points　out　that　the　random　of　search　range　could　lead　to　repeated　search　or　overlong　search　time.　Based　on　the　analysis　of　flocking　behavior　of　fish　school,　a　parameter　＇dist＇　is　defined　to　control　the　search　range　and　time.　This　paper　presents　an　improved　＇fish-search＇　algorithm,　in　which　the　search　process　could　adjust　the　search　range　adaptively.　Simulation　shows　some　improvements　over　the　original　fish-search　algorithm.　©　2005　IEEE.