# 8.5

Revision as of 14:06, 21 September 2020 by Algowikiadmin (talk | contribs) (Created page with "In both algorithms, an edge can only ever be picked once, so they will both eventually terminate regardless of negative edge weights. I also suspect that they still generate...")

In both algorithms, an edge can only ever be picked once, so they will both eventually terminate regardless of negative edge weights. I also suspect that they still generate minimum spanning trees, but don't have a proof of it.

Back to Chapter 8