SUATU METODA UNTUK MENENTUKAN SEMUA MINIMUM SPANNING TREE DALAM SUATU GRAF GRAF .
<p>Abstract:<align=\"justify\"> <br /> <br /> <br /> <br /> There are several known methods for finding a minimum spanning tree from connected weighted graph. Using Kruskal\'s algorithm and independent components of edges equivalent classes,...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Theses |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/5301 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |