{"_buckets": {"deposit": "dbfa29cc-3945-4e23-80ef-69363ebfbd54"}, "_deposit": {"id": "3233", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3233"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3233", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Finding Shortest Path Using Floyd Warshall’s Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Nowadays, the transportation becomes avital role in developing countries so people needto know the shortest ways. Therefore, this systemwill be developed intending to reduce thetransportation time by applying one of the shortestpath finding algorithm in six townships of theYangon Map.They are Kamaryut, Hlaing,Sanchaung ,Mayangone, Dagon and Mingalardontownships. There are many shortest path findingalgorithms such as Dijkstra’s Algorithm, Floyd-Warshall’s Algorithm, Bellman Ford Algorithm,A* Algorithm, Johnson’s Algorithm etc. Thispaper is intended to use Floyd-Warshall’sAlgorithm and applied to find shortest ways in sixtownships of the Yangon map. In this paper, 158nodes and 182 edges are defined and the vertexwill be represented as well-known places such as(Hospitals, Hotel, Parks, Pagodas, Airport,Markets, Shopping Mall, City Mart, Junctions,Private Hospitals, Private Clinics, Embassies,Museums, Theatres, Churches, Cinema Halls,Golf Clubs, Cemetery, Restaurants, Coffee Shopsand Universities) so user have already familiarwith these places. This system will intend tosupport the users such as car drivers, taxi drivers,visitors from other states and divisions ofMyanmar and also foreigners. It is also supportfor the ambulance and fire truck for saving humanlives."}]}, "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-07-19"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "129_PDFsam_PSC_final proof.pdf", "filesize": [{"value": "345 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 345000.0, "url": {"url": "https://meral.edu.mm/record/3233/files/129_PDFsam_PSC_final proof.pdf"}, "version_id": "a32468c5-4363-42a3-a77a-51ff95125e5d"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eighth 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": "Thu, Hnin Pwint"}, {"subitem_authors_fullname": "Aung, Khin Sanda"}]}]}, "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": "2017-12-27"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1003"}, "item_title": "Finding Shortest Path Using Floyd Warshall’s Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003233", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-19"}, "publish_date": "2019-07-19", "publish_status": "0", "recid": "3233", "relation": {}, "relation_version_is_last": true, "title": ["Finding Shortest Path Using Floyd Warshall’s Algorithm"], "weko_shared_id": -1}