{"id":"https://openalex.org/W3107593374","doi":"https://doi.org/10.1109/icstcc50638.2020.9259693","title":"An Experimental Comparison of Implementations of Dijkstra\u2019s Single Source Shortest Path Algorithm Using Different Priority Queues Data Structures","display_name":"An Experimental Comparison of Implementations of Dijkstra\u2019s Single Source Shortest Path Algorithm Using Different Priority Queues Data Structures","publication_year":2020,"publication_date":"2020-10-08","ids":{"openalex":"https://openalex.org/W3107593374","doi":"https://doi.org/10.1109/icstcc50638.2020.9259693","mag":"3107593374"},"language":"en","primary_location":{"id":"doi:10.1109/icstcc50638.2020.9259693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icstcc50638.2020.9259693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 24th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5038927678","display_name":"Andrei-Daniel Andreiana","orcid":null},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Andrei-Daniel Andreiana","raw_affiliation_strings":["Faculty of Automatics, Computers and Electronics, University of Craiova, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Automatics, Computers and Electronics, University of Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004297417","display_name":"Costin B\u0103dic\u0103","orcid":"https://orcid.org/0000-0001-8480-9867"},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Costin Badica","raw_affiliation_strings":["Faculty of Automatics, Computers and Electronics, University of Craiova, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Automatics, Computers and Electronics, University of Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006790639","display_name":"Eugen Ganea","orcid":"https://orcid.org/0000-0002-6808-8278"},"institutions":[{"id":"https://openalex.org/I97553796","display_name":"University of Craiova","ror":"https://ror.org/03s251g81","country_code":"RO","type":"education","lineage":["https://openalex.org/I97553796"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Eugen Ganea","raw_affiliation_strings":["Faculty of Automatics, Computers and Electronics, University of Craiova, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Automatics, Computers and Electronics, University of Craiova, Romania","institution_ids":["https://openalex.org/I97553796"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038927678"],"corresponding_institution_ids":["https://openalex.org/I97553796"],"apc_list":null,"apc_paid":null,"fwci":0.3084,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62321662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7622374296188354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6942917108535767},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6184248924255371},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5896801352500916},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5635984539985657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5498785376548767},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5367817282676697},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.4946593940258026},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.49383267760276794},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4844527244567871},{"id":"https://openalex.org/keywords/fibonacci-number","display_name":"Fibonacci number","score":0.47482022643089294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33958613872528076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2829682230949402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2584417164325714},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.2534811496734619},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23765382170677185},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09147420525550842}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7622374296188354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6942917108535767},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6184248924255371},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5896801352500916},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5635984539985657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5498785376548767},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5367817282676697},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.4946593940258026},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.49383267760276794},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4844527244567871},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.47482022643089294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33958613872528076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2829682230949402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2584417164325714},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.2534811496734619},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23765382170677185},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09147420525550842}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icstcc50638.2020.9259693","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icstcc50638.2020.9259693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 24th International Conference on System Theory, Control and Computing (ICSTCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1555471913","https://openalex.org/W1966271560","https://openalex.org/W1979957675","https://openalex.org/W2084224084","https://openalex.org/W2169528473","https://openalex.org/W2197264974","https://openalex.org/W2227557434","https://openalex.org/W2570013196","https://openalex.org/W2909085420","https://openalex.org/W2953994797","https://openalex.org/W2966130688","https://openalex.org/W4246219036","https://openalex.org/W6610028881","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2462581792","https://openalex.org/W2385402343","https://openalex.org/W2622198096","https://openalex.org/W2918875451","https://openalex.org/W2791159917","https://openalex.org/W2374583081","https://openalex.org/W2105736249","https://openalex.org/W2970418136","https://openalex.org/W3107593374","https://openalex.org/W2147042075"],"abstract_inverted_index":{"We":[0],"compare":[1],"multiple":[2],"implementations":[3,46],"of":[4,29,52,62,70,142],"Dijkstra's":[5],"single":[6],"source":[7],"shortest":[8],"paths":[9],"algorithm":[10],"using":[11],"two":[12],"different":[13,48],"data":[14,27,130],"structures.":[15],"The":[16,72,89,111],"algorithms":[17],"are":[18,94],"implemented":[19],"in":[20,96],"Python":[21],"programming":[22],"language":[23],"and":[24,34,42,54],"the":[25,55,84,87,122,125],"test":[26,59],"consisted":[28],"graphs":[30],"with":[31],"1,000":[32],"vertices":[33,93],"up":[35],"to":[36,58,82,86,91,108,120,124],"900,000":[37],"edges,":[38],"split":[39],"into":[40],"sparse":[41],"dense":[43],"graphs.":[44,71],"These":[45],"have":[47],"theoretical":[49,139],"time":[50,140],"orders":[51],"complexity":[53],"experiment":[56],"aims":[57],"if":[60],"any":[61],"them":[63],"is":[64,106,132],"more":[65,133],"suitable":[66],"for":[67],"certain":[68],"types":[69],"min-max":[73],"binary":[74,80],"heap":[75,113],"implementation":[76,115],"uses":[77,116],"a":[78,117,137],"min":[79],"tree":[81],"keep":[83,121],"distances":[85,90,123],"vertices.":[88,126],"all":[92],"held":[95],"an":[97],"array,":[98],"but":[99],"their":[100],"positions":[101],"change,":[102],"so":[103],"extra":[104],"logic":[105],"required":[107],"access":[109],"them.":[110],"Fibonacci":[112,118],"(FH)":[114],"forest":[119],"While":[127],"implementing":[128],"this":[129],"structure":[131],"elaborate,":[134],"it":[135],"offers":[136],"good":[138],"order":[141],"complexity.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}