{"id":"https://openalex.org/W2350503565","doi":null,"title":"Optimization and Realization of Dijkstra Algorithm Program","display_name":"Optimization and Realization of Dijkstra Algorithm Program","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2350503565","mag":"2350503565"},"language":"en","primary_location":{"id":"mag:2350503565","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=THSF200812010","pdf_url":null,"source":{"id":"https://openalex.org/S2764837439","display_name":"Journal of Tonghua Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Tonghua Normal University","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2350503565"],"child_works_count":0,"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/A5101773950","display_name":"Zhongwen Wang","orcid":"https://orcid.org/0000-0003-1885-0014","observed_orcids":["https://orcid.org/0000-0003-1885-0014"]},"institutions":[{"id":"https://openalex.org/I4210155042","display_name":"Tonghua Normal University","ror":"https://ror.org/05nq41m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210155042"]}],"countries":["CN"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Zhongwen Wang","raw_affiliation_strings":["Department of Computer,Tonghua Normal University,Tonghua,Jilin 134002,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer,Tonghua Normal University,Tonghua,Jilin 134002,China)","institution_ids":["https://openalex.org/I4210155042"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101773950"],"corresponding_institution_ids":["https://openalex.org/I4210155042"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9721999764442444,"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.9721999764442444,"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.023399999365210533,"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/T11269","display_name":"Algorithms and Data Compression","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9980000257492065},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9350000023841858},{"id":"https://openalex.org/keywords/priority-queues","display_name":"priority queues","score":0.9810000061988831},{"id":"https://openalex.org/keywords/algorithm-optimization","display_name":"algorithm optimization","score":0.8529999852180481},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.828000009059906},{"id":"https://openalex.org/keywords/node-selection","display_name":"node selection","score":0.4519999921321869}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9233757257461548},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6724602580070496},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6628808379173279},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.660962700843811},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6022281050682068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6019847989082336},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5817326903343201},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5582178831100464},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5128660202026367},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.47044438123703003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4695338010787964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46872174739837646},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.45527926087379456},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4466910660266876},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3357042372226715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2733718454837799},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25591909885406494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19911447167396545},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0543501079082489},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2350503565","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=THSF200812010","pdf_url":null,"source":{"id":"https://openalex.org/S2764837439","display_name":"Journal of Tonghua Normal University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Tonghua Normal University","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2368945219","https://openalex.org/W2348033017","https://openalex.org/W2381351584","https://openalex.org/W2352224812","https://openalex.org/W2361669028","https://openalex.org/W2348177054","https://openalex.org/W2347883311","https://openalex.org/W2376387406","https://openalex.org/W2362266639"],"abstract_inverted_index":{"This":[0],"paper":[1,10],"analyses":[2],"the":[3,23,29],"classical":[4],"Dijkstra":[5],"algorithm":[6,14,18,30],"and":[7],"its":[8],"disadvantages.The":[9],"emphasizes":[11],"an":[12],"optimization":[13],"of":[15,19,28],"shortest":[16],"paths,namely,the":[17],"priority":[20],"queue,when":[21],"searching":[22],"smallest":[24],"nodes,the":[25],"time":[26],"complexity":[27],"is":[31],"reduced":[32],"significantly.":[33]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2350503565","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
