{"_buckets": {"deposit": "930b5b3d-9b2b-4cf5-bbd5-04e685044dfb"}, "_deposit": {"id": "3875", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3875"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3875", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search)", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This paper is intended to implement shortest path way oftransportation. To efficiently extract knowledge, Depth FirstSearch (DFS), Breadth First Search (BFS), Uniform CostSearch (UCS) algorithms depend on the efficient processing ofnodes. Using these algorithms, nodes will be retrieved onspecific path. Specified answering can provide the end user oncity and traveler can explore the directory information. It isintended to analysis the DFS, BFS and UCS algorithms forimplementing and designing the model of transportation. Itemphasizes the shortest path way system. This system isimplemented by using J# programming language and datastorage for Microsoft SQL server"}]}, "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": "Analysis of Searching Deterministic Shortest Path Algorithms.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/3875/files/Analysis of Searching Deterministic Shortest Path Algorithms.pdf"}, "version_id": "4b7426dd-e266-428a-b5b6-b181c5401d2e"}]}, "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": "Htwe, Khin Mar"}, {"subitem_authors_fullname": "Naing, Thinn"}]}]}, "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/1599"}, "item_title": "Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search)", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003875", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3875", "relation": {}, "relation_version_is_last": true, "title": ["Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search)"], "weko_shared_id": -1}