{"_buckets": {"deposit": "bc868fb0-9840-4dd4-96a6-996e8e9008ef"}, "_deposit": {"id": "3860", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3860"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3860", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding Shortest Path By Using A* and Dijkstra Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This paper is intended to present optimal route finding system for road network application. It is used to operate in complicated mapping situations and new unknown environments. This technique can be implemented to find the optimal path from source to destination in region of map. This system use A* and Dijkstra algorithms to draw plan and develop the Geographic Information System(GIS) assisted optimal road network route finding and give shortest path. The optimal (or) shortest path based on distance or time or cost. And then evaluates the performance of these two algorithms."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-01"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "55033.pdf", "filesize": [{"value": "600 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 600000.0, "url": {"url": "https://meral.edu.mm/record/3860/files/55033.pdf"}, "version_id": "b1bbda57-23fe-486f-80dc-0e9d4207c507"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fourth Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Oo, Aye Thandar"}, {"subitem_authors_fullname": "Khin, Mie Mie"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2009-12-30"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1585"}, "item_title": "Finding Shortest Path By Using A* and Dijkstra Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003860", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-01"}, "publish_date": "2019-08-01", "publish_status": "0", "recid": "3860", "relation": {}, "relation_version_is_last": true, "title": ["Finding Shortest Path By Using A* and Dijkstra Algorithm"], "weko_shared_id": -1}