Abstract
Shortest path query is one of the hot issues in graph theory research. Shortest path query plays the most basic and important role in many fields, including urban transportation network, social network, biological information network and so on. At present, there are two kinds of shortest path query algorithms, one is accurate shortest path query, the other is approximate shortest path query. This paper discusses and analyzes the composite functional space of city and building. For the concept of composite space in residential buildings, in terms of shortest path query, this paper puts forward corresponding query strategies for different index construction strategies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
