Landmark community approximate optimal path query with pure linguistic attributes

摘要

The optimal path problem of graph data is a classical problem, but with the continuous development of information technology, the linguistic attributes of path descriptions are becoming more and more abundant. The nature of these attributes has uncertainty feature, which makes the choice of optimal path more difficult. Therefore, in order to solve this problem, this paper takes the path of large-scale graph and the uncertainty of linguistic attributes and the inconsistency of evaluation scale described as the research object and uses LWAA and landmark community technology to effectively solve the query problem of approximate optimal path. The efficiency of the algorithm is also verified by experiments.