Please enable JavaScript.

Coggle requires JavaScript to display documents.

Greedy Technique - Coggle Diagram

- - - - the problem of finding a minimum spanning tree for a given weighted connected graph
  - - - On each iteration, expands the current tree in a greedy manner
        by attaching to it the nearest vertex not in this tree
        
        Nearest vertex: a vertex no in the tree connected to
        a vertex in the tree by an edge of the smallest weight
        
        Algorithm stops after including all vertices
- - - - then adds it to the collection to replace Sx and Sy, which
        are deleted from it.
    - - quick union
      - quick find