MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "2347ab8c-8644-4345-a05a-8cc4cfdd6e4d"}, "_deposit": {"created_by": 228, "id": "8432", "owner": "228", "owners": [228], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "8432"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00008432"}, "author_link": [], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "\"Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City\"", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "\"Firstly, Dijkstra’s algorithm of Graph theory is studied. Then the twelve famous pagodas in\nMandalay city are stated. And then, the shortest path is calculated on our problem by graph.\nFinally, the shortest path to visit the famous pagodas in Mandalay City is described\""}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "graph"}, {"interim": "vertices"}, {"interim": "edges"}, {"interim": "weighted graph"}, {"interim": "path"}, {"interim": "Dijkstra’s algorithm"}, {"interim": "Graph theory."}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2022-12-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Nang Yu Yu Win.pdf", "filesize": [{"value": "568 KB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 568000.0, "url": {"url": "https://meral.edu.mm/record/8432/files/Nang Yu Yu Win.pdf"}, "version_id": "69d22fc2-7b76-4009-ba29-6bd369393938"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "2022", "subitem_journal_title": "Yadanabon University Research Journal", "subitem_pages": "291-298", "subitem_volume": "Vol.12, No.1"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Nang Yu Yu Win"}, {"subitem_authors_fullname": "Mon Yee Aye"}]}]}, "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": "2022-08-12"}, "item_title": "\"Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City\"", "item_type_id": "21", "owner": "228", "path": ["1582966516414"], "permalink_uri": "https://meral.edu.mm/records/8432", "pubdate": {"attribute_name": "Deposit date", "attribute_value": "2022-12-02"}, "publish_date": "2022-12-02", "publish_status": "0", "recid": "8432", "relation": {}, "relation_version_is_last": true, "title": ["\"Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City\""], "weko_shared_id": -1}
"Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City"
https://meral.edu.mm/records/8432
https://meral.edu.mm/records/8432f4903cd8-c9e0-4196-b41a-79f71b950af9
2347ab8c-8644-4345-a05a-8cc4cfdd6e4d
Name / File | License | Actions |
---|---|---|
![]() |
Publication type | ||||||
---|---|---|---|---|---|---|
Journal article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | "Observation of Shortest Paths from Mahamuni Pagoda to Aung Dawmuu Pagoda in Mandalay City" | |||||
Language | en | |||||
Publication date | 2022-08-12 | |||||
Authors | ||||||
Nang Yu Yu Win | ||||||
Mon Yee Aye | ||||||
Description | ||||||
"Firstly, Dijkstra’s algorithm of Graph theory is studied. Then the twelve famous pagodas in Mandalay city are stated. And then, the shortest path is calculated on our problem by graph. Finally, the shortest path to visit the famous pagodas in Mandalay City is described" |
||||||
Keywords | ||||||
graph, vertices, edges, weighted graph, path, Dijkstra’s algorithm, Graph theory. | ||||||
Journal articles | ||||||
2022 | ||||||
Yadanabon University Research Journal | ||||||
291-298 | ||||||
Vol.12, No.1 |