com.googlecode.blaisemath.graph.layout.PositionalAddingLayout Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of blaise-graph-theory Show documentation
Graph definitions and algorithms.
There is a newer version: 4.0.8
package com.googlecode.blaisemath.graph.layout;

/*
 * #%L
 * BlaiseGraphTheory
 * --
 * Copyright (C) 2009 - 2019 Elisha Peterson
 * --
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *      http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */

import com.google.common.collect.Maps;
import com.google.common.graph.Graph;
import com.googlecode.blaisemath.graph.StaticGraphLayout;
import com.googlecode.blaisemath.graph.layout.CircleLayout.CircleLayoutParameters;
import org.checkerframework.checker.nullness.qual.Nullable;

import java.awt.geom.Point2D;
import java.util.Map;

/**
 * Position graph nodes nearby connected nodes. The first layout parameter is the approximate distance between a new
 * node's position and the position of connected nodes. Nodes with existing locations are not affected.
 * 
 * @author Elisha Peterson
 */
public class PositionalAddingLayout implements StaticGraphLayout {
    
    @Override
    public String toString() {
        return "Position nodes near existing adjacent nodes";
    }

    @Override
    public CircleLayoutParameters createParameters() {
        return new CircleLayoutParameters();
    }

    @Override
    public  Map layout(Graph g, @Nullable Map curLocations, CircleLayoutParameters parameters) {
        double len = parameters.getRadius();
        Map res = Maps.newHashMap();
        for (N node : g.nodes()) {
            if (curLocations != null && curLocations.containsKey(node)) {
                res.put(node, curLocations.get(node));
            } else {
                double sx = 0;
                double sy = 0;
                int n = 0;
                for (N o : g.adjacentNodes(node)) {
                    Point2D.Double p = curLocations.get(o);
                    if (p != null) {
                        sx += p.x;
                        sy += p.y;
                        n++;
                    }
                }
                if (n == 0) {
                    double theta = 2*Math.PI*Math.random();
                    res.put(node, new Point2D.Double(sx+2*len*Math.cos(theta), sy+2*len*Math.sin(theta)));
                } else if (n == 1) {
                    double theta = 2*Math.PI*Math.random();
                    res.put(node, new Point2D.Double(sx+len*Math.cos(theta), sy+len*Math.sin(theta)));
                } else {
                    res.put(node, new Point2D.Double(sx/n, sy/n));
                }
            }
        }
        return res;
    }

}