{"id":"https://openalex.org/W2990669092","doi":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","title":"Finding the shortest path in a graph and its visualization using C# and WPF","display_name":"Finding the shortest path in a graph and its visualization using C# and WPF","alternate_titles":[],"publication_year":2020,"publication_date":"2020-04-01","ids":{"openalex":"https://openalex.org/W2990669092","doi":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","mag":"2990669092"},"language":"en","primary_location":{"id":"doi:10.11591/ijece.v10i2.pp2054-2059","doi":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/19843/13731","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2990669092"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/19843/13731","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064925509","display_name":"Radoslav Mavrevski","orcid":"https://orcid.org/0000-0002-6968-8937","observed_orcids":["https://orcid.org/0000-0002-6968-8937"]},"institutions":[{"id":"https://openalex.org/I168129107","display_name":"South-West University \"Neofit Rilski\"","ror":"https://ror.org/002wcjr61","country_code":"BG","type":"education","lineage":["https://openalex.org/I168129107"]}],"countries":["BG"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Radoslav Mavrevski","raw_affiliation_strings":["South-West University \"Neofit Rilski\""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"South-West University \"Neofit Rilski\"","institution_ids":["https://openalex.org/I168129107"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026630420","display_name":"Metodi Traykov","orcid":"https://orcid.org/0000-0002-8512-5640","observed_orcids":["https://orcid.org/0000-0002-8512-5640","https://orcid.org/0000-0003-2507-1924"]},"institutions":[{"id":"https://openalex.org/I122492136","display_name":"New Bulgarian University","ror":"https://ror.org/002qhr126","country_code":"BG","type":"education","lineage":["https://openalex.org/I122492136"]},{"id":"https://openalex.org/I168129107","display_name":"South-West University \"Neofit Rilski\"","ror":"https://ror.org/002wcjr61","country_code":"BG","type":"education","lineage":["https://openalex.org/I168129107"]}],"countries":["BG"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Metodi Traykov","raw_affiliation_strings":["South-West University \"Neofit Rilski\"\nNew Bulgarian University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"South-West University \"Neofit Rilski\"\nNew Bulgarian University","institution_ids":["https://openalex.org/I122492136","https://openalex.org/I168129107"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052778208","display_name":"Ivan Trenchev","orcid":"https://orcid.org/0000-0002-8726-4775","observed_orcids":["https://orcid.org/0000-0002-8726-4775"]},"institutions":[{"id":"https://openalex.org/I168129107","display_name":"South-West University \"Neofit Rilski\"","ror":"https://ror.org/002wcjr61","country_code":"BG","type":"education","lineage":["https://openalex.org/I168129107"]},{"id":"https://openalex.org/I190032430","display_name":"University of Library Studies and Information Technologies","ror":"https://ror.org/001nkz398","country_code":"BG","type":"education","lineage":["https://openalex.org/I190032430"]}],"countries":["BG"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ivan Trenchev","raw_affiliation_strings":["South-West University \"Neofit Rilski\"\nUniversity of Library Studies and Information Technologies Sofia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"South-West University \"Neofit Rilski\"\nUniversity of Library Studies and Information Technologies Sofia","institution_ids":["https://openalex.org/I168129107","https://openalex.org/I190032430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064925509"],"corresponding_institution_ids":["https://openalex.org/I168129107"],"apc_list":null,"apc_paid":null,"fwci":0.8886,"has_fulltext":true,"cited_by_count":7,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.69733785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"10","issue":"2","first_page":"2054","last_page":"2054"},"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.5205000042915344,"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.5205000042915344,"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.3449999988079071,"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/T10533","display_name":"Teaching and Learning Programming","score":0.06129999831318855,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/shortest-path","display_name":"shortest path","score":0.9879999756813049},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":1.0},{"id":"https://openalex.org/keywords/network-visualization","display_name":"network visualization","score":0.777999997138977},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.9190000295639038},{"id":"https://openalex.org/keywords/windows-presentation-foundation","display_name":"WPF","score":0.7490000128746033},{"id":"https://openalex.org/keywords/c","display_name":"C++","score":0.8370000123977661},{"id":"https://openalex.org/keywords/educational-software","display_name":"educational software","score":0.6690000295639038}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8567419052124023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7049511671066284},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6970398426055908},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6459999680519104},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.6237167119979858},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5857723951339722},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5679616332054138},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5626705288887024},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5261815786361694},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5099958181381226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.457329124212265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4563297927379608},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.44807979464530945},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41903236508369446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3473602533340454},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.22281426191329956},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11377626657485962}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.11591/ijece.v10i2.pp2054-2059","doi":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/19843/13731","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"},{"id":"pmh:oai:zenodo.org:4089918","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/4089918","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE) 10(2) 2054-2059","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.11591/ijece.v10i2.pp2054-2059","doi":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","is_oa":true,"landing_page_url":"https://doi.org/10.11591/ijece.v10i2.pp2054-2059","pdf_url":"http://ijece.iaescore.com/index.php/IJECE/article/download/19843/13731","source":{"id":"https://openalex.org/S2764532672","display_name":"International Journal of Electrical and Computer Engineering (IJECE)","issn_l":"2088-8708","issn":["2088-8708"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310315009","host_organization_name":"Institute of Advanced Engineering and Science (IAES)","host_organization_lineage":["https://openalex.org/P4310315009"],"host_organization_lineage_names":["Institute of Advanced Engineering and Science (IAES)"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electrical and Computer Engineering (IJECE)","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2990669092.pdf","grobid_xml":"https://content.openalex.org/works/W2990669092.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W75321019","https://openalex.org/W134829688","https://openalex.org/W1563763097","https://openalex.org/W2006674970","https://openalex.org/W2095876017","https://openalex.org/W2112500891","https://openalex.org/W2116849571","https://openalex.org/W2132928495","https://openalex.org/W2151108065","https://openalex.org/W2253385761","https://openalex.org/W2424427247","https://openalex.org/W2773796190","https://openalex.org/W2774105910","https://openalex.org/W2793550157","https://openalex.org/W2923701032","https://openalex.org/W2945185559","https://openalex.org/W2952978216","https://openalex.org/W2982389593","https://openalex.org/W2995562203","https://openalex.org/W2996196357","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4297634443"],"related_works":["https://openalex.org/W2348287729","https://openalex.org/W2072188088","https://openalex.org/W2948709491","https://openalex.org/W2393741605","https://openalex.org/W3209614263","https://openalex.org/W2398424124","https://openalex.org/W7103331150","https://openalex.org/W3213185299","https://openalex.org/W2810319369","https://openalex.org/W7025519485"],"abstract_inverted_index":{"The":[0,25,84],"shortest":[1,41,94],"path":[2,42,95,124],"problem":[3,7,56],"is":[4,28,52,105,116],"a":[5,47,54,58,106,117],"classic":[6],"in":[8,15,46,63,127],"mathematics":[9],"and":[10,33,77,99,115],"computer":[11],"science":[12],"with":[13],"applications":[14],"Economics":[16],"(sequential":[17],"decision":[18],"making,":[19],"analysis":[20],"of":[21,31,35,112,123,133],"social":[22],"networks,":[23],"etc.).":[24],"presented":[26],"work":[27],"an":[29,89],"example":[30],"realizing":[32],"applying":[34],"Dijkstra's":[36,113],"algorithm":[37,114],"to":[38],"find":[39],"the":[40,70,80,93,110],"between":[43,96],"two":[44,97],"vertices":[45,98],"connected,":[48],"undirected":[49,90],"graph,":[50,91],"which":[51],"often":[53],"solved":[55],"at":[57],"time":[59],"annual":[60],"International":[61],"Olympiad":[62],"Informatics.":[64],"For":[65],"this":[66,128],"purpose,":[67],"are":[68,130],"used":[69],"technologies,":[71],".NET":[72],"4.0,":[73],"Visual":[74],"Studio":[75],"2010,":[76],"WPF":[78],"for":[79,109],"graphical":[81],"user":[82],"interface.":[83],"implemented":[85],"program":[86],"allows":[87],"drawing":[88],"visualizing":[92],"finding":[100],"its":[101],"value.":[102],"This":[103],"software":[104],"valuable":[107],"tool":[108],"study":[111],"great":[118],"pedagogic":[119],"instrument.":[120],"All":[121],"figures":[122],"visualization":[125,135],"included":[126],"paper":[129],"actual":[131],"screenshots":[132],"our":[134],"program.":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2990669092","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2019-12-05T00:00:00"}
