mmnaseri / cs-review

An effort to refresh my CS background
MIT License
251 stars 72 forks source link

Investigate Kruskal's algorithm for finding a minimum spanning tree #4

Closed mmnaseri closed 9 years ago

mmnaseri commented 9 years ago

The algorithm described by the book does not return the minimum tree. This is demonstrated by the book on page 633 of the ebook where the result has a total weight of 37, while running the Prim algorithm from the book returns a total of 35, as seen on page 635.

Figure out why this behavior is not considered as invalid.