Does a graph with distinct weight on edges exists that prim and kruskal algorithm produce different trees ?
A Question About MST
Does a graph with distinct weight on edges exists that prim and kruskal algorithm produce different trees ?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | ChickenInKitchen | 2019-01-09 15:09:03 | 128 | Initial revision (published) |