The invention discloses a method and a device for obtaining a multi-hop neighbor node. The method and the device are used for improving the calculation efficiency of inquiring the multi-hop neighbor node in a big graph. The method for obtaining the multi-hop neighbor node comprises the steps of obtaining a zero-hop neighbor of each node in a topological network to obtain a full node zero-hop neighbor set; when a first node serves as an appointed node, calculating a k+1-hop neighbor set of the first node through an iterative calculation process below, wherein the iterative calculation process comprises a step a of obtaining the k-hop neighbor set of the first node and a step b of connecting the k-hop target node in the k-hop neighbor set of the first node and two node pairs with the same initial nodes in the full node zero-hop neighbor set into a node pair, and obtaining the k+1-hop neighbor set of the first node after the connection of the node pair is finished; and when the hop number k+1 of the k+1-hop neighbor set of the first node is equal to kmax, outputting the k+1-hop neighbor set of the first node and a corresponding k+1 hop path.