{"id":"https://openalex.org/W4313451637","doi":"https://doi.org/10.1109/iccr56254.2022.9995925","title":"Research Paper on Path-finding Algorithm Visualizer","display_name":"Research Paper on Path-finding Algorithm Visualizer","publication_year":2022,"publication_date":"2022-10-06","ids":{"openalex":"https://openalex.org/W4313451637","doi":"https://doi.org/10.1109/iccr56254.2022.9995925"},"language":"en","primary_location":{"id":"doi:10.1109/iccr56254.2022.9995925","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccr56254.2022.9995925","pdf_url":null,"source":{"id":"https://openalex.org/S4363608155","display_name":"2022 International Conference on Cyber Resilience (ICCR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Cyber Resilience (ICCR)","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/A5023128844","display_name":"Lukesh Singh","orcid":null},"institutions":[{"id":"https://openalex.org/I101407740","display_name":"Chandigarh University","ror":"https://ror.org/05t4pvx35","country_code":"IN","type":"education","lineage":["https://openalex.org/I101407740"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Lukesh Singh","raw_affiliation_strings":["Chandigarh University,Department of Comp. Science and Engineering,GHARUAN,India","Department of Comp. Science and Engineering, Chandigarh University, GHARUAN, India"],"affiliations":[{"raw_affiliation_string":"Chandigarh University,Department of Comp. Science and Engineering,GHARUAN,India","institution_ids":["https://openalex.org/I101407740"]},{"raw_affiliation_string":"Department of Comp. Science and Engineering, Chandigarh University, GHARUAN, India","institution_ids":["https://openalex.org/I101407740"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065756502","display_name":"Shanu Khare","orcid":null},"institutions":[{"id":"https://openalex.org/I101407740","display_name":"Chandigarh University","ror":"https://ror.org/05t4pvx35","country_code":"IN","type":"education","lineage":["https://openalex.org/I101407740"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shanu Khare","raw_affiliation_strings":["Chandigarh University,Department of Comp. Science and Engineering,GHARUAN,India","Department of Comp. Science and Engineering, Chandigarh University, GHARUAN, India"],"affiliations":[{"raw_affiliation_string":"Chandigarh University,Department of Comp. Science and Engineering,GHARUAN,India","institution_ids":["https://openalex.org/I101407740"]},{"raw_affiliation_string":"Department of Comp. Science and Engineering, Chandigarh University, GHARUAN, India","institution_ids":["https://openalex.org/I101407740"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019773741","display_name":"Anjum Parvez","orcid":"https://orcid.org/0000-0002-4874-1372"},"institutions":[{"id":"https://openalex.org/I3132702812","display_name":"Uttaranchal University","ror":"https://ror.org/00ba6pg24","country_code":"IN","type":"education","lineage":["https://openalex.org/I3132702812"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anjum Parvez","raw_affiliation_strings":["Uttaranchal University,Dehradun,India,248007"],"affiliations":[{"raw_affiliation_string":"Uttaranchal University,Dehradun,India,248007","institution_ids":["https://openalex.org/I3132702812"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000043933","display_name":"Sahil Verma","orcid":"https://orcid.org/0000-0003-3136-4029"},"institutions":[{"id":"https://openalex.org/I3130021832","display_name":"Shree Guru Gobind Singh Tricentenary University","ror":"https://ror.org/04kf25f32","country_code":"IN","type":"education","lineage":["https://openalex.org/I3130021832"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sahil Verma","raw_affiliation_strings":["SGT University,Faculty of Computer Science and Engineering,Gurugram,India,122505"],"affiliations":[{"raw_affiliation_string":"SGT University,Faculty of Computer Science and Engineering,Gurugram,India,122505","institution_ids":["https://openalex.org/I3130021832"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023128844"],"corresponding_institution_ids":["https://openalex.org/I101407740"],"apc_list":null,"apc_paid":null,"fwci":0.2983,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.6504117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.7657638788223267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7463670969009399},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5783609747886658},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5648034811019897},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.559879720211029},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.553684413433075},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5269033908843994},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4525415897369385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.440354585647583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17467013001441956},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10688143968582153}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7657638788223267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7463670969009399},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5783609747886658},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5648034811019897},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.559879720211029},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.553684413433075},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5269033908843994},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4525415897369385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.440354585647583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17467013001441956},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10688143968582153},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccr56254.2022.9995925","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccr56254.2022.9995925","pdf_url":null,"source":{"id":"https://openalex.org/S4363608155","display_name":"2022 International Conference on Cyber Resilience (ICCR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Cyber Resilience (ICCR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1551562380","https://openalex.org/W2006486528","https://openalex.org/W2129038678","https://openalex.org/W2273716102","https://openalex.org/W2566046254","https://openalex.org/W2583031215","https://openalex.org/W2890018513","https://openalex.org/W2988770539","https://openalex.org/W3013375325","https://openalex.org/W3032258369","https://openalex.org/W3084339707","https://openalex.org/W3093482193","https://openalex.org/W3098549142","https://openalex.org/W3114312526","https://openalex.org/W3127251655","https://openalex.org/W3202485599","https://openalex.org/W3203863635","https://openalex.org/W3204340292","https://openalex.org/W3210174156","https://openalex.org/W4224050562","https://openalex.org/W4226129413","https://openalex.org/W4312271338","https://openalex.org/W6679201544","https://openalex.org/W6801783040","https://openalex.org/W6803050921"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W2128644323","https://openalex.org/W2509483197"],"abstract_inverted_index":{"We":[0,30,88],"present":[1],"you":[2],"a":[3,11,14,17,95],"Path":[4],"finding":[5],"Visualizer,":[6],"and":[7,19,22,49,63,65,79],"the":[8,20,27,58,70,83,103],"visualizer":[9],"finds":[10],"path":[12],"from":[13],"source":[15],"to":[16,45,101],"destination":[18],"root":[21],"terminal":[23],"is":[24,67,75],"set":[25],"by":[26],"user":[28],"only.":[29],"had":[31,89],"used":[32,90],"graph":[33,47,51],"theory":[34,48],"approach":[35,97],"in":[36,57,69],"this":[37,40,80],"project.":[38],"In":[39],"paper":[41],"we":[42,54],"have":[43,55],"tried":[44],"use":[46],"various":[50],"algorithms":[52,93],"which":[53],"studied":[56],"chapter":[59],"of":[60,85,98],"data":[61,86],"structures":[62],"algorithm":[64,100],"that":[66],"all":[68],"backend.":[71],"The":[72],"front":[73],"end":[74],"designed":[76],"using":[77],"Pygame":[78],"project":[81],"reflects":[82],"application":[84],"structures.":[87],"different":[91,96],"Pathfinding":[92],"with":[94],"each":[99],"obtain":[102],"shortest":[104],"path.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}