PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL
One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005). MST begins from tree namely a connected graph has...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | |
| Опубликовано: |
Universitas Muhammadiyah Metro,
2012-10-01T00:00:00Z.
|
| Предметы: | |
| Online-ссылка: | Connect to this object online. |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Internet
Connect to this object online.3rd Floor Main Library
| Шифр: |
A1234.567 |
|---|---|
| Копировать 1 | Доступно |