org.opennms.features.vaadin.topology.jung.BalloonLayoutAlgorithm.java Source code

Introduction

Here is the source code for org.opennms.features.vaadin.topology.jung.BalloonLayoutAlgorithm.java

Source

/*******************************************************************************
 * This file is part of OpenNMS(R).
 *
 * Copyright (C) 2012 The OpenNMS Group, Inc.
 * OpenNMS(R) is Copyright (C) 1999-2012 The OpenNMS Group, Inc.
 *
 * OpenNMS(R) is a registered trademark of The OpenNMS Group, Inc.
 *
 * OpenNMS(R) is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published
 * by the Free Software Foundation, either version 3 of the License,
 * or (at your option) any later version.
 *
 * OpenNMS(R) is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with OpenNMS(R).  If not, see:
 *      http://www.gnu.org/licenses/
 *
 * For more information contact:
 *     OpenNMS(R) Licensing <license@opennms.org>
 *     http://www.opennms.org/
 *     http://www.opennms.com/
 *******************************************************************************/

package org.opennms.features.vaadin.topology.jung;

import java.awt.Dimension;
import java.awt.Point;
import java.awt.geom.Point2D;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Set;

import org.apache.commons.collections15.Transformer;
import org.opennms.features.vaadin.topology.Edge;
import org.opennms.features.vaadin.topology.Graph;
import org.opennms.features.vaadin.topology.GraphContainer;
import org.opennms.features.vaadin.topology.LayoutAlgorithm;
import org.opennms.features.vaadin.topology.Vertex;

import edu.uci.ics.jung.algorithms.layout.BalloonLayout;
import edu.uci.ics.jung.graph.Tree;

public class BalloonLayoutAlgorithm implements LayoutAlgorithm {

    Object m_rootItemId;

    public BalloonLayoutAlgorithm(Object rootItemId) {
        m_rootItemId = rootItemId;
    }

    public void updateLayout(GraphContainer graph) {

        Graph g = new Graph(graph);

        int szl = g.getSemanticZoomLevel();

        Vertex rootItem = g.getDisplayVertex(g.getVertexByItemId(m_rootItemId), szl);

        Tree<Vertex, Edge> tree = new OrderedKAryTree<Vertex, Edge>(50);

        Queue<Vertex> q = new LinkedList<Vertex>();
        Set<Vertex> found = new HashSet<Vertex>();

        q.add(rootItem);

        tree.addVertex(rootItem);

        Vertex v;
        while ((v = q.poll()) != null) {
            List<Edge> edges = g.getEdgesForVertex(v, szl);
            for (Edge e : edges) {
                Vertex neighbor = e.getSource() != v ? e.getSource() : e.getTarget();
                tree.addEdge(e, v, neighbor);
                if (!found.contains(neighbor)) {
                    q.add(neighbor);
                }
            }
        }

        BalloonLayout<Vertex, Edge> layout = new BalloonLayout<Vertex, Edge>(tree);
        layout.setInitializer(new Transformer<Vertex, Point2D>() {
            public Point2D transform(Vertex v) {
                return new Point(v.getX(), v.getY());
            }
        });

        for (Vertex vertex : g.getVertices(szl)) {
            layout.lock(vertex, vertex.isLocked());
        }

        layout.setSize(new Dimension(750, 750));

        List<Vertex> vertices = g.getVertices(szl);
        for (Vertex vertex : vertices) {
            Point2D point = layout.transform(v);
            vertex.setX((int) point.getX());
            vertex.setY((int) point.getY());
        }

    }

}