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:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/5301 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
Be the first to leave a comment!