mapss.dif.graph
Interface MinimumSpanningTreeAnalyzer

All Superinterfaces:

mocgraph.analysis.analyzer.Analyzer, mocgraph.analysis.analyzer.GraphAnalyzer

All Known Implementing Classes:

MinimumSpanningTreeStrategy

public interface MinimumSpanningTreeAnalyzer
extends mocgraph.analysis.analyzer.GraphAnalyzer

Base interface for the computation of minimum spanning trees in a graph.

Since:

Ptolemy II 2.0

Version:

$Id: MinimumSpanningTreeAnalyzer.java 409 2007-05-13 19:47:16Z plishker $

Author:

Shuvra S. Bhattacharyya

See Also:

mocgraph.analysis.MinimumSpanningTreeAnalysis

Method Summary

java.util.List	edges() Return the edges of a minimal spanning tree.
double	weight() Return the weight (sum of edge weights) of the minimum spanning tree that is computed.

Methods inherited from interface mocgraph.analysis.analyzer.GraphAnalyzer

graph

Methods inherited from interface mocgraph.analysis.analyzer.Analyzer

toString, valid

Method Detail

edges

java.util.List edges()

Return the edges of a minimal spanning tree. Each element of the list is an Edge.

Returns:

The edges in a minimal spanning tree.

weight

double weight()

Return the weight (sum of edge weights) of the minimum spanning tree that is computed.

Returns:

The weight of the minimum spanning tree.