Interface MinimumSpanningTree<V,W>

All Known Implementing Classes:
KruskalMinimumSpanningTree, PrimMinimumSpanningTree
public interface MinimumSpanningTree<V,W>
Interface for Minimum Spanning Tree (MST) algorithms.
Since:
1.0
Author:
Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

  • Method Summary

    Modifier and Type
    Method
    Description
    Set<WeightedEdge<V,W>>
    findMST(WeightedGraph<V,W> graph)
    Finds the Minimum Spanning Tree of the given graph.

  • Method Details

    • findMST

      Set<WeightedEdge<V,W>> findMST(WeightedGraph<V,W> graph)
      Finds the Minimum Spanning Tree of the given graph.
      Parameters:
      graph - the graph to find the MST for
      Returns:
      a set of edges representing the MST