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

Introduction

Here is the source code for org.opennms.features.vaadin.topology.jung.RadialTreeLayoutAlgorithm.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.List;

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.TreeLayout;
import edu.uci.ics.jung.graph.DelegateForest;
import edu.uci.ics.jung.graph.DirectedSparseGraph;

public class RadialTreeLayoutAlgorithm implements LayoutAlgorithm {

    public void updateLayout(GraphContainer graph) {

        Graph g = new Graph(graph);

        int szl = g.getSemanticZoomLevel();

        DirectedSparseGraph<Vertex, Edge> jungGraph = new DirectedSparseGraph<Vertex, Edge>();

        List<Vertex> vertices = g.getVertices(szl);

        for (Vertex v : vertices) {
            jungGraph.addVertex(v);
        }

        List<Edge> edges = g.getEdges(szl);

        for (Edge e : edges) {
            jungGraph.addEdge(e, e.getSource(), e.getTarget());
        }

        DelegateForest<Vertex, Edge> forest = new DelegateForest<Vertex, Edge>(jungGraph);

        TreeLayout<Vertex, Edge> layout = new TreeLayout<Vertex, Edge>(forest);
        layout.setInitializer(new Transformer<Vertex, Point2D>() {
            public Point2D transform(Vertex v) {
                return new Point(v.getX(), v.getY());
            }
        });
        layout.setSize(new Dimension(750, 750));

        for (Vertex v : vertices) {
            Point2D point = layout.transform(v);
            v.setX((int) point.getX());
            v.setY((int) point.getY());
        }
    }

}