The combing operation is a military strategy where a single or several groups of forces start to raid the region in a parallel manner. In this paper, we put forward a military combing operation influenced graph traversal that mimics the operation strategy for social network graph traversal. The proposed algorithm uses a set data structure to keep alternate path nodes to the unexplored nodes. The advantage of combing traversal is that it can simultaneously use more than one instance to explore the graph which is similar to the combing operation strategy and it successfully explores the given search space. We have compared its performance with standard blind traversals using various topologies and found that the proposed combing traversal performs better in certain scenarios.