Abstract: An innovative algorithm based on flooding algorithm and intimacy in social relations search is put forward on the problem that intimacy is ignored and only can search the shortest or the optimal path. All paths from source node to destination node can be searched in the algorithm. What's more, paths are ordered by intimacy. The intimacy is mapped to edge weight. Social relational graph is storaged in adjacency list. Flooding algorithm is used to search paths. The simulation results show that this algorithm is performed with high comprehensive and strong adaptability. At the same time it is showed that the path with short path length, is not necessarily has larger intimacy. On the contrary, the path with long path length, is not necessarily has smaller intimacy.