Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "ab713677-9af6-4a0b-8047-57c14952b8eb"}, "_deposit": {"id": "3882", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3882"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3882", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Implementation of Shortest Path Finding System by Using Kruskal Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs have been used in a wide variety ofapplication. Some of these applications are analysis of electricalcircuits, finding shortest routes, project planning, andidentification of chemical compounds, statistical mechanics,genetics, and social sciences and so on. Indeed, it might be wellsaid that of all mathematical structures, graphs are the mostwidely used. This paper is intended to study how a graph theoryapplied to find shortest path by using a minimum spanning tree.In this study, it is implemented popular locations of theMandalay City as the vertices of an undirected graph. In thissystem, the associated distances between each location arepresented as weights of the edges of the graph. There are threedifferent algorithms to obtain a minimum –cost spanning of aconnected, undirected graph. Our shortest path finding system isfocused on Kruskal Algorithm."}]}, "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": "Implementation of Shortest Path Finding System by Using Kruskal Algorithm.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/3882/files/Implementation of Shortest Path Finding System by Using Kruskal Algorithm.pdf"}, "version_id": "2efb5dd6-64d2-4b96-a92a-c94ac37c4eb8"}]}, "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": "Aung, Htike Htet"}, {"subitem_authors_fullname": "Zaw, Win Win"}]}]}, "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/1605"}, "item_title": "Implementation of Shortest Path Finding System by Using Kruskal Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003882", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3882", "relation": {}, "relation_version_is_last": true, "title": ["Implementation of Shortest Path Finding System by Using Kruskal Algorithm"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Implementation of Shortest Path Finding System by Using Kruskal Algorithm

http://hdl.handle.net/20.500.12678/0000003882
http://hdl.handle.net/20.500.12678/0000003882
7e9180d9-e69d-4748-957e-c942a31de34d
ab713677-9af6-4a0b-8047-57c14952b8eb
None
Preview
Name / File License Actions
Implementation Implementation of Shortest Path Finding System by Using Kruskal Algorithm.pdf (10 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 13:44:39.211362
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL