Abstract: The present application provides a method for querying a high-connectivity shortest influence path between users, a device, and a product. The method includes: constructing an indexed linked list data structure based on an obtained social network graph; determining, based on the indexed linked list data structure, a start node, a target node, and a path connectivity in a current iteration, whether there is a shortest influence path satisfying the path connectivity in the current iteration; if yes, updating a minimum path connectivity in a previous iteration and determining the path connectivity in the current iteration based on the minimum path connectivity; or if no, determining the path connectivity in the current iteration as a maximum path connectivity in the previous iteration; and continuing the iteration based on the maximum path connectivity and the minimum path connectivity until a high-connectivity shortest influence path is determined.

Abstract: The present application provides a method for querying a high-connectivity shortest influence path between users, a device, and a product. The method includes: constructing an indexed linked list data structure based on an obtained social network graph; determining, based on the indexed linked list data structure, a start node, a target node, and a path connectivity in a current iteration, whether there is a shortest influence path satisfying the path connectivity in the current iteration; if yes, updating a minimum path connectivity in a previous iteration and determining the path connectivity in the current iteration based on the minimum path connectivity; or if no, determining the path connectivity in the current iteration as a maximum path connectivity in the previous iteration; and continuing the iteration based on the maximum path connectivity and the minimum path connectivity until a high-connectivity shortest influence path is determined.