Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight. In a Kruskal’s algorithm, the weight sorting of edge value will ease the finding of the shortest path. This algorithm has ind...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
State Islamic University Sunan Kalijaga
2014-12-01
|
| シリーズ: | IJID (International Journal on Informatics for Development) |
| 主題: | |
| オンライン･アクセス: | https://ejournal.uin-suka.ac.id/saintek/ijid/article/view/1575 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|