{"_buckets": {"deposit": "3e44720a-59a3-44a3-93c8-7b31b605992a"}, "_deposit": {"created_by": 232, "id": "9265", "owner": "232", "owners": [232], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "9265"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00009265", "sets": ["1704444930107", "1704332280616"]}, "author_link": [], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding the Shortest-Path between two Locations", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Dijkstra\u0027s Shortest-Path Algorithm is presented and considered with examples. Then finding the shortest-path between two locations are studied."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "weighted graph"}, {"interim": "label"}, {"interim": "shortest-path"}, {"interim": "minimum length"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2024-01-26"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "2_DrKHT_Technological University (Kalay).pdf", "filesize": [{"value": "739 KB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 739000.0, "url": {"url": "https://meral.edu.mm/record/9265/files/2_DrKHT_Technological University (Kalay).pdf"}, "version_id": "b815c4f7-11a5-4b81-bfb7-49ea80618060"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "1", "subitem_journal_title": "Engineering Technology and Scientific Journal (Kalay)", "subitem_volume": "1"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Khin HlaThi"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2019-08-01"}, "item_title": "Finding the Shortest-Path between two Locations", "item_type_id": "21", "owner": "232", "path": ["1704332280616", "1704444930107"], "permalink_uri": "https://meral.edu.mm/records/9265", "pubdate": {"attribute_name": "Deposit date", "attribute_value": "2024-01-26"}, "publish_date": "2024-01-26", "publish_status": "0", "recid": "9265", "relation": {}, "relation_version_is_last": true, "title": ["Finding the Shortest-Path between two Locations"], "weko_shared_id": -1}