org.apache.commons.graph.algorithm.spanning
Class MinimumSpanningForest
java.lang.Object
org.apache.commons.graph.domain.basic.UndirectedGraphImpl
org.apache.commons.graph.algorithm.spanning.MinimumSpanningForest
- All Implemented Interfaces:
- Graph, java.lang.reflect.InvocationHandler, MutableGraph, UndirectedGraph, WeightedGraph
- public class MinimumSpanningForest
- extends UndirectedGraphImpl
- implements UndirectedGraph, WeightedGraph
Methods inherited from class org.apache.commons.graph.domain.basic.UndirectedGraphImpl |
addEdge, addEdge, addVertex, connect, disconnect, getEdges, getEdges, getVertices, getVertices, getWeight, invoke, removeEdge, removeVertex, setWeight |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
queue
private org.apache.commons.collections.PriorityQueue queue
labels
private java.util.Map labels
chords
private java.util.Set chords
ddg
private DDirectedGraph ddg
MinimumSpanningForest
public MinimumSpanningForest(WeightedGraph graph)
MinimumSpanningForest
public MinimumSpanningForest(boolean isMin,
WeightedGraph graph)
findLabel
protected Label findLabel(Vertex v)
connectsLabels
protected boolean connectsLabels(Graph graph,
Edge e)
addEdge
protected void addEdge(WeightedGraph graph,
Edge edge)
calculateMSF
protected void calculateMSF(boolean isMin,
WeightedGraph graph)
getChords
public java.util.Set getChords()