Improved trust path searching in mobile social networks

People are considered as important resources nowadays. When we are caught in some problem, how to find a direct or indirect friend, who is professional in the specific field, to help us is the key point. The popularity of social network provides a great platform for the solution of the problem through computer automation. Dijkstra is a classical algorithm for searching the shortest path between two nodes. However, the time complexity is enormous, especially when the network is complex like social networks. A novel algorithm is proposed in the paper for improving the situation. The weight used in the novel algorithm is decided by three-dimensional factors while the Dijkstra algorithm only involves the one for edges in a graph. And we validate that comparing to Dijkstra it is more efficient in both theory and experiment.