Data Structure & Algorithm in Java

⌘K
  1. Home
  2. Docs
  3. Data Structure & Alg...
  4. Graphs
  5. Spanning Trees & Minimum Spanning Tree

Spanning Trees & Minimum Spanning Tree

• A subgraph T of a connected graph G is called spanning tree of G if T is a tree and T include all vertices of G.

image 156
  • Network Design
  • Circuit Design
  • Telecommunication
  • Transportation Planning
  • Power Distribution Networks

Minimum Spanning Tree:

How can we help?

Leave a Reply

Your email address will not be published. Required fields are marked *