A Dijkstra-based Approach in Multi-attribute Resources Search
Huaimin Wang · Computer and Modernization · 2006
Shortest path is a typical and widely applied issue,Dijkstra algorithm is often used in solving optimal path.But Dijkstra algorithm is an abstract process,it can still reduce algorithm complexity by using a large amount of useful object information in practice.In multi-attribute resources search based on traffic-net,this paper describes the preference decision upon completeness and incompleteness condition,so as to get the result rapidly.