is smallest travelling tree algorithm correct?
the smallest travelling tree problem take connected weighted graph subset the edges lowest sum weight while retaining graph connected (and effect indirect an acyclic graph).
the algorithm i am deliberation is:
- find cycles.
- remove largest dilemma any cycle.
the way chronicle an sourroundings limited "rule satisfaction" but any iterative constructs. competence also convenient insanely together hardware (i.e. component where design have several times some-more degrees association following cycles).
edits:
the above finished stateless feeling (all edges largest dilemma any cycle selected/kept/ignored, others removed).
Comments
Post a Comment