DS – Minimum Spanning Tree

Minimum Spanning Tree

  • It is an application of Graph. It uses Graph data structure.
  • It is a non linear data structure.
  • It is an algorithm.

Minimum spanning tree is a tree which is not cyclic.

How many spanning trees possible here:

  • We can find the spanning trees count depends on number of cycles present in the graph.
  • One graph can have many cycles.

Scroll to Top