{"_buckets": {"deposit": "26138b70-2840-4923-bce6-fad9ea91be6e"}, "_deposit": {"created_by": 71, "id": "6922", "owner": "71", "owners": [71], "owners_ext": {"displayname": "Kay_Thwe", "username": "kay_thwe"}, "pid": {"revision_id": 0, "type": "depid", "value": "6922"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006922", "sets": ["user-miit"]}, "communities": ["miit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Application of Shortest Path", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In this paper A shortest path algorithm was stadied. Firstly, the basic defination of graph theory sach as graph, directed graph (or digraph) , weighted graph, path and shortest path will be introduced. Then the shortest path algorithm of Dijkstra into the Matlab computer program was coded and applied it to the real road network of some towns in the Sagaing Division so that there are two places in the region. This program texts the road network which includes 16 junctions and 28 road-segments. It is hoped that the program will be applied network of a city or of larger sizes."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "graph"}, {"interim": "digraph weighted graph"}, {"interim": "path"}, {"interim": "shortest path"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-18"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Application of Shortest Path.pdf", "filesize": [{"value": "1.3 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 1300000.0, "url": {"url": "https://meral.edu.mm/record/6922/files/Application of Shortest Path.pdf"}, "version_id": "ce904ea1-be45-4754-b4c4-d407c56632ce"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "No.1", "subitem_journal_title": "The Annual University Journal on Research and Applications", "subitem_pages": "169-173", "subitem_volume": "Vol.1"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Aye Aye Myint"}, {"subitem_authors_fullname": "Myat Moe Khaing"}, {"subitem_authors_fullname": "Wai Zin Phyo"}]}]}, "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-12-21"}, "item_title": "Application of Shortest Path", "item_type_id": "21", "owner": "71", "path": ["1582963674932", "1597397085335"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000006922", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-18"}, "publish_date": "2020-12-18", "publish_status": "0", "recid": "6922", "relation": {}, "relation_version_is_last": true, "title": ["Application of Shortest Path"], "weko_shared_id": -1}