{"_buckets": {"deposit": "0e1638a4-d55a-41ae-a743-720234e51070"}, "_deposit": {"id": "3885", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3885"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3885", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Searching Shortest Path for Military Map", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Combinatorial reasoning underlines all analysis ofcomputer systems. It plays a similar role in discrete operationalresearch problems. Two of the most basic mathematical aspectsof computer science concern the speed and logical structure of acomputer program, Dijkstra’s algorithm solve the single sourceshortest path problem for a non-negative weights graph. It findsthe shortest path from an initial vertex to all the other vertices.This system applies the Dijkstra’s algorithm that search theshortest path. This paper presents searches the Line ofOperation on the Military Map. The system is alreadyimplemented to reduce the time consuming by searching theshortest path on the Military Map."}]}, "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-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Searching Shortest Path for Military Map.pdf", "filesize": [{"value": "10 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 10000.0, "url": {"url": "https://meral.edu.mm/record/3885/files/Searching Shortest Path for Military Map.pdf"}, "version_id": "5e67fd88-be82-4346-89cb-8d7244257a2c"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Third 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": "Hein, Nay Zaw"}]}]}, "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-08-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1608"}, "item_title": "Searching Shortest Path for Military Map", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003885", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3885", "relation": {}, "relation_version_is_last": true, "title": ["Searching Shortest Path for Military Map"], "weko_shared_id": -1}