{"id":"https://openalex.org/W2918875451","doi":"https://doi.org/10.5121/csit.2019.90204","title":"THE IMPLICIT PATH COST OPTIMIZATION IN DIJKSTRA ALGORITHM USING HASH MAP DATA STRUCTURE","display_name":"THE IMPLICIT PATH COST OPTIMIZATION IN DIJKSTRA ALGORITHM USING HASH MAP DATA STRUCTURE","publication_year":2019,"publication_date":"2019-02-23","ids":{"openalex":"https://openalex.org/W2918875451","doi":"https://doi.org/10.5121/csit.2019.90204","mag":"2918875451"},"language":"en","primary_location":{"id":"doi:10.5121/csit.2019.90204","doi":"https://doi.org/10.5121/csit.2019.90204","is_oa":true,"landing_page_url":"https://doi.org/10.5121/csit.2019.90204","pdf_url":"https://doi.org/10.5121/csit.2019.90204","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science & Information Technology(CS & IT)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5121/csit.2019.90204","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090750806","display_name":"Mabroukah Amarif","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I153265617","display_name":"Sebha University","ror":"https://ror.org/04m1ha467","country_code":"LY","type":"education","lineage":["https://openalex.org/I153265617"]}],"countries":["LY"],"is_corresponding":false,"raw_author_name":"Mabroukah Amarif","raw_affiliation_strings":["Department of Computer Sciences, Sebha University, Sebha, Libya"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Sebha University, Sebha, Libya","institution_ids":["https://openalex.org/I153265617"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004445893","display_name":"Ibtusam Alashoury","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I153265617","display_name":"Sebha University","ror":"https://ror.org/04m1ha467","country_code":"LY","type":"education","lineage":["https://openalex.org/I153265617"]}],"countries":["LY"],"is_corresponding":false,"raw_author_name":"Ibtusam Alashoury","raw_affiliation_strings":["Department of Computer Sciences, Sebha University, Sebha, Libya"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Sebha University, Sebha, Libya","institution_ids":["https://openalex.org/I153265617"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153265617"],"apc_list":null,"apc_paid":null,"fwci":0.63,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.57822651,"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":"33","last_page":"44"},"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.586899995803833,"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.586899995803833,"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.3889000117778778,"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.01940000057220459,"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.9929999709129333},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8429999947547913},{"id":"https://openalex.org/keywords/hash-tables","display_name":"hash tables","score":0.7910000085830688},{"id":"https://openalex.org/keywords/path-reconstruction","display_name":"path reconstruction","score":0.6629999876022339},{"id":"https://openalex.org/keywords/search-time","display_name":"search time","score":0.6539999842643738},{"id":"https://openalex.org/keywords/graph-data-structures","display_name":"graph data structures","score":0.6759999990463257}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7935283184051514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.707427978515625},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7023049592971802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6472692489624023},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6304613947868347},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6200445890426636},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5972464084625244},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5958850979804993},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5857383608818054},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5799720287322998},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5753808617591858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5726074576377869},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4725715219974518},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.44346508383750916},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.42082807421684265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41693758964538574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3972572684288025},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5121/csit.2019.90204","doi":"https://doi.org/10.5121/csit.2019.90204","is_oa":true,"landing_page_url":"https://doi.org/10.5121/csit.2019.90204","pdf_url":"https://doi.org/10.5121/csit.2019.90204","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science & Information Technology(CS & IT)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5121/csit.2019.90204","doi":"https://doi.org/10.5121/csit.2019.90204","is_oa":true,"landing_page_url":"https://doi.org/10.5121/csit.2019.90204","pdf_url":"https://doi.org/10.5121/csit.2019.90204","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science & Information Technology(CS & IT)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2918875451.pdf","grobid_xml":"https://content.openalex.org/works/W2918875451.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1552631569","https://openalex.org/W1584874830","https://openalex.org/W1804733508","https://openalex.org/W1986215947","https://openalex.org/W1994937951","https://openalex.org/W2013553222","https://openalex.org/W2037520890","https://openalex.org/W2044712659","https://openalex.org/W2074812379","https://openalex.org/W2105306717","https://openalex.org/W2112276406","https://openalex.org/W2153202529","https://openalex.org/W2169528473","https://openalex.org/W2499634225","https://openalex.org/W2534760828","https://openalex.org/W2578319993","https://openalex.org/W2942018599","https://openalex.org/W3141776272","https://openalex.org/W4224021803","https://openalex.org/W4246219036","https://openalex.org/W4255740074","https://openalex.org/W4285092328","https://openalex.org/W6661556521","https://openalex.org/W6931904925"],"related_works":["https://openalex.org/W6893720179","https://openalex.org/W7097830740","https://openalex.org/W2347883311","https://openalex.org/W2160122475","https://openalex.org/W2383983084","https://openalex.org/W1985118543","https://openalex.org/W1978144076","https://openalex.org/W2387829241","https://openalex.org/W2381351584","https://openalex.org/W3205035283"],"abstract_inverted_index":{"The":[0],"shortest":[1,50,105],"path":[2,51,64],"between":[3,52],"two":[4,53],"points":[5,54],"is":[6,41,45,129],"one":[7],"of":[8,78,91],"the":[9,13,29,49,62,66,70,76,84,89,102,110,121,125,134,140],"greatest":[10],"challenges":[11],"facing":[12],"researchers":[14],"nowadays.There":[15],"are":[16,22],"many":[17],"algorithms":[18],"and":[19,24,32,37,107],"mechanisms":[20],"that":[21,120],"designed":[23],"still":[25],"all":[26],"according":[27,74],"to":[28,60,75,82,137],"certain":[30],"approach":[31],"adopted":[33],"structural.The":[34],"most":[35],"famous":[36],"widely":[38],"used":[39,81],"algorithm":[40,93,135],"Dijkstra":[42,92],"algorithm,":[43],"which":[44],"characterized":[46],"by":[47],"finding":[48],"through":[55,124],"graph":[56],"data":[57,79,98,116,127],"structure.It's":[58],"obvious":[59],"find":[61],"implicit":[63,112],"from":[65],"solution":[67,85,104],"path;":[68],"but":[69],"searching":[71,122],"time":[72,123],"varies":[73],"type":[77],"structure":[80,99,128],"store":[83],"path.This":[86],"paper":[87],"improves":[88],"development":[90],"using":[94],"linked":[95],"hash":[96],"map":[97],"for":[100,139],"storing":[101],"produced":[103],"path,":[106],"then":[108],"investigates":[109],"subsequent":[111],"paths":[113],"within":[114],"this":[115],"structure.The":[117],"result":[118],"show":[119],"given":[126],"much":[130],"better":[131],"than":[132],"restart":[133],"again":[136],"search":[138],"same":[141],"path.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-03-11T00:00:00"}