{"id":"https://openalex.org/W2364536249","doi":null,"title":"Research and Application of Dijkstra Algorithm in GIS","display_name":"Research and Application of Dijkstra Algorithm in GIS","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2364536249","mag":"2364536249"},"language":"en","primary_location":{"id":"mag:2364536249","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-AYXB201002017.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764443225","display_name":"Journal of Anyang Institute of Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4363603789","host_organization_name":"Anyang Institute of Technology","host_organization_lineage":["https://openalex.org/P4363603789"],"host_organization_lineage_names":["Anyang Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Anyang Institute of Technology","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100344077","display_name":"Si Cheng","orcid":"https://orcid.org/0000-0001-7417-2890","observed_orcids":["https://orcid.org/0000-0001-7417-2890"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Si Cheng","raw_affiliation_strings":[",LI Yuan2 , CHEN Xue-gong1"],"raw_orcid":"https://orcid.org/0000-0001-7417-2890","affiliations":[{"raw_affiliation_string":",LI Yuan2 , CHEN Xue-gong1","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100344077"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3509,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53812057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5849999785423279,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5849999785423279,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.16660000383853912,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.07209999859333038,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9990000128746033},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7670000195503235},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.6800000071525574},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"adjacency list","score":0.9200000166893005},{"id":"https://openalex.org/keywords/shortest-path-queries","display_name":"shortest path queries","score":0.6679999828338623},{"id":"https://openalex.org/keywords/gis-applications","display_name":"GIS applications","score":0.44999998807907104},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.578000009059906}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.946252703666687},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8349449634552002},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7591889500617981},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.681881308555603},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.6755952835083008},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.670866072177887},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6686258912086487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6250609159469604},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5755004286766052},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5701121091842651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5659719109535217},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.462126225233078},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23810702562332153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12188535928726196}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2364536249","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-AYXB201002017.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764443225","display_name":"Journal of Anyang Institute of Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4363603789","host_organization_name":"Anyang Institute of Technology","host_organization_lineage":["https://openalex.org/P4363603789"],"host_organization_lineage_names":["Anyang Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Anyang Institute of Technology","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2375333907","https://openalex.org/W2376328589","https://openalex.org/W29976114","https://openalex.org/W2387729688","https://openalex.org/W1552631569","https://openalex.org/W2153202529","https://openalex.org/W2364227094","https://openalex.org/W2103610940","https://openalex.org/W2379118701","https://openalex.org/W3200343262"],"abstract_inverted_index":{"Based":[0],"on":[1,55],"the":[2,8,14,18,37,41,46,56],"classical":[3],"Dijkstra":[4,25],"algorithm,":[5],"according":[6],"to":[7,31,40],"actual":[9],"road":[10,19],"conditions":[11],",and":[12],"using":[13],"adjacency":[15],"list":[16],"as":[17],"network":[20],"stored":[21],"structure,":[22],"we":[23],"applies":[24],"Algorithm":[26],"into":[27],"GIS":[28,53],"in":[29,52],"order":[30],"reducing":[32],"search":[33],"times":[34],"when":[35],"finding":[36],"shortest":[38,49],"path":[39,50],"next":[42],"one.":[43],"We":[44],"realize":[45],"application":[47],"of":[48,58],"queries":[51],"based":[54],"algorithm":[57],"Dijkstra.":[59]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}