Java Forest.getVertexCount方法代码示例

import edu.uci.ics.jung.graph.Forest; //导入方法依赖的package包/类
/**
 * Creates a minimum spanning forest from the supplied graph, populating the
 * supplied Forest, which must be empty. 
 * If the supplied root is null, or not present in the Graph,
 * then an arbitrary Graph vertex will be selected as the root.
 * If the Minimum Spanning Tree does not include all vertices of the
 * Graph, then a leftover vertex is selected as a root, and another
 * tree is created
 * @param graph the Graph to find MST in
 * @param forest the Forest to populate. Must be empty
 * @param root first Tree root, may be null
 */
public MinimumSpanningForest(Graph<V, E> graph, Forest<V,E> forest, 
        Collection<V> roots) {
    
    if(forest.getVertexCount() != 0) {
        throw new IllegalArgumentException("Supplied Forest must be empty");
    }
    this.graph = graph;
    this.forest = forest;
    Set<E> unfinishedEdges = new HashSet<E>(graph.getEdges());
    if(roots != null && !roots.isEmpty()) {
    	V root = roots.iterator().next();
    	System.out.println(root);
    	roots.remove(root);
    	this.forest.addVertex(root);
    }
    updateForest(forest.getVertices(), unfinishedEdges, roots);
}
 

import edu.uci.ics.jung.graph.Forest; //导入方法依赖的package包/类
/**
 * Creates a minimum spanning forest from the supplied graph, populating the
 * supplied Forest, which must be empty. 
 * If the supplied root is null, or not present in the Graph,
 * then an arbitrary Graph vertex will be selected as the root.
 * If the Minimum Spanning Tree does not include all vertices of the
 * Graph, then a leftover vertex is selected as a root, and another
 * tree is created
 * @param graph the Graph to find MST in
 * @param forest the Forest to populate. Must be empty
 * @param root first Tree root, may be null
 * @param weights edge weights, may be null
 */
public MinimumSpanningForest(Graph<V, E> graph, Forest<V,E> forest, 
		V root, Map<E, Double> weights) {
	
	if(forest.getVertexCount() != 0) {
		throw new IllegalArgumentException("Supplied Forest must be empty");
	}
	this.graph = graph;
	this.forest = forest;
	if(weights != null) {
		this.weights = weights;
	}
	Set<E> unfinishedEdges = new HashSet<E>(graph.getEdges());
	if(graph.getVertices().contains(root)) {
		this.forest.addVertex(root);
	}
	updateForest(forest.getVertices(), unfinishedEdges);
}
 

import edu.uci.ics.jung.graph.Forest; //导入方法依赖的package包/类
/**
 * create a forest from the supplied graph, populating the
 * supplied Forest, which must be empty. 
 * If the supplied root is null, or not present in the Graph,
 * then an arbitary Graph vertex will be selected as the root.
 * If the Minimum Spanning Tree does not include all vertices of the
 * Graph, then a leftover vertex is selected as a root, and another
 * tree is created
 * @param graph the Graph to find MST in
 * @param forest the Forest to populate. Must be empty
 * @param weights edge weights, may be null
 */
public MinimumSpanningForest2(Graph<V, E> graph, 
		Forest<V,E> forest, 
		Factory<? extends Graph<V,E>> treeFactory,
		Transformer<E, Double> weights) {
	
	if(forest.getVertexCount() != 0) {
		throw new IllegalArgumentException("Supplied Forest must be empty");
	}
	this.graph = graph;
	this.forest = forest;
	if(weights != null) {
		this.weights = weights;
	}
	
	WeakComponentClusterer<V,E> wcc =
		new WeakComponentClusterer<V,E>();
	Set<Set<V>> component_vertices = wcc.transform(graph);
	Collection<Graph<V,E>> components = 
		FilterUtils.createAllInducedSubgraphs(component_vertices, graph);
	
	for(Graph<V,E> component : components) {
		PrimMinimumSpanningTree<V,E> mst = 
			new PrimMinimumSpanningTree<V,E>(treeFactory, this.weights);
		Graph<V,E> subTree = mst.transform(component);
		if(subTree instanceof Tree) {
			TreeUtils.addSubTree(forest, (Tree<V,E>)subTree, null, null);
		}
	}
}