Index Link

  • RootNode
    • Co-operative College, Mandalay
    • Cooperative College, Phaunggyi
    • Co-operative University, Sagaing
    • Co-operative University, Thanlyin
    • Dagon University
    • Kyaukse University
    • Laquarware Technological college
    • Mandalay Technological University
    • Mandalay University of Distance Education
    • Mandalay University of Foreign Languages
    • Maubin University
    • Mawlamyine University
    • Meiktila University
    • Mohnyin University
    • Myanmar Institute of Information Technology
    • Myanmar Maritime University
    • National Management Degree College
    • Naypyitaw State Academy
    • Pathein University
    • Sagaing University
    • Sagaing University of Education
    • Taunggyi University
    • Technological University, Hmawbi
    • Technological University (Kyaukse)
    • Technological University Mandalay
    • University of Computer Studies, Mandalay
    • University of Computer Studies Maubin
    • University of Computer Studies, Meikhtila
    • University of Computer Studies Pathein
    • University of Computer Studies, Taungoo
    • University of Computer Studies, Yangon
    • University of Dental Medicine Mandalay
    • University of Dental Medicine, Yangon
    • University of Information Technology
    • University of Mandalay
    • University of Medicine 1
    • University of Medicine 2
    • University of Medicine Mandalay
    • University of Myitkyina
    • University of Public Health, Yangon
    • University of Veterinary Science
    • University of Yangon
    • West Yangon University
    • Yadanabon University
    • Yangon Technological University
    • Yangon University of Distance Education
    • Yangon University of Economics
    • Yangon University of Education
    • Yangon University of Foreign Languages
    • Yezin Agricultural University
    • New Index

Item

{"_buckets": {"deposit": "29dcca99-fccb-416b-b133-dcd89aa16c5c"}, "_deposit": {"id": "3490", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3490"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3490", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Nowadays, optimization/minimization is a key factor in almost all topics of operation research, management science and economic. Road networks can be minimized within different constraints like time, distance, cost and traffic running on the road. This study is based on distance to calculate shortest path. This paper is intended to present shortest path finding system on Mandalay road map. In this system, Transitive Closure and Dijkstra’s algorithms are used to find the shortest path. Transitive Closure algorithm is used to get all pairs of paths and the result is used to check whether there is a path between user chosen source and destination. If the pair of path exists, then Dijkstra’s algorithm calculates shortest path of user desired source and destination. And then the result of shortest path is display to user. This system presents how it can be applied Transitive Closure and Dijkstra’s Algorithms on Mandalay road map. In this system, the locations of Mandalay as vertices and associated distance between each location as weight of edges of a directed graph."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Transitive Closure"}, {"interim": "Dijkstra"}, {"interim": "Algorithm"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-24"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (31).pdf", "filesize": [{"value": "374 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 374000.0, "url": {"url": "https://meral.edu.mm/record/3490/files/psc2010paper (31).pdf"}, "version_id": "71529dc9-4d76-4d27-beb8-72c3539f0951"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fifth  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": "Phyo, K-zin"}, {"subitem_authors_fullname": "Win, Thandar"}]}]}, "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": "2010-12-16"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1235"}, "item_title": "Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003490", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-24"}, "publish_date": "2019-07-24", "publish_status": "0", "recid": "3490", "relation": {}, "relation_version_is_last": true, "title": ["Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms"], "weko_shared_id": -1}

Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms

http://hdl.handle.net/20.500.12678/0000003490
9784731d-febb-4f66-9754-2266f6779520
29dcca99-fccb-416b-b133-dcd89aa16c5c
None
Name / File License Actions
psc2010paper psc2010paper (31).pdf (374 Kb)
Publication type
Article
Upload type
Publication
Title
Title Shortest Path Finding System by using Transitive Closure and Dijkstra’s Algorithms
Language en
Publication date 2010-12-16
Authors
Phyo, K-zin
Win, Thandar
Description
Nowadays, optimization/minimization is a key factor in almost all topics of operation research, management science and economic. Road networks can be minimized within different constraints like time, distance, cost and traffic running on the road. This study is based on distance to calculate shortest path. This paper is intended to present shortest path finding system on Mandalay road map. In this system, Transitive Closure and Dijkstra’s algorithms are used to find the shortest path. Transitive Closure algorithm is used to get all pairs of paths and the result is used to check whether there is a path between user chosen source and destination. If the pair of path exists, then Dijkstra’s algorithm calculates shortest path of user desired source and destination. And then the result of shortest path is display to user. This system presents how it can be applied Transitive Closure and Dijkstra’s Algorithms on Mandalay road map. In this system, the locations of Mandalay as vertices and associated distance between each location as weight of edges of a directed graph.
Keywords
Transitive Closure, Dijkstra, Algorithm
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/1235
Journal articles
Fifth Local Conference on Parallel and Soft Computing
Conference papers
Books/reports/chapters
Thesis/dissertations
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats