com.googlecode.blaisemath.graph.modules.suppliers.ProximityGraphSupplier Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of blaise-graphtheory Show documentation
Link graph definitions, algorithms, and visualization.
The newest version!
/**
 * ProximityGraphBuilder.java
 * Created Aug 18, 2012
 */

package com.googlecode.blaisemath.graph.modules.suppliers;

/*
 * #%L
 * BlaiseGraphTheory
 * --
 * Copyright (C) 2009 - 2016 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 java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.List;
import com.googlecode.blaisemath.graph.Graph;
import com.googlecode.blaisemath.graph.modules.suppliers.GraphSuppliers.GraphSupplierSupport;
import com.googlecode.blaisemath.graph.SparseGraph;

/**
 * 
 *  Generates a graph in specified bounding box, where edges are added for points
 *  that are within a certain distance.
 * 
 * @author elisha
 */
public final class ProximityGraphSupplier extends GraphSupplierSupport{

    private Rectangle2D bounds = new Rectangle2D.Double();
    private double connectDistance = 1;
    
    /** Initialize without arguments */
    public ProximityGraphSupplier() {}

    public ProximityGraphSupplier(boolean directed, int nodes, Rectangle2D bounds, double dst) {
        super(directed, nodes);
        this.bounds = bounds;
        this.connectDistance = dst;
    }

    @Override
    public String toString() {
        return "ProximityGraphSupplier{" + "bounds=" + bounds + ", connectDistance=" + connectDistance + '}';
    }

    public Rectangle2D getBounds() {
        return bounds;
    }

    public void setBounds(Rectangle2D bounds) {
        this.bounds = bounds;
    }

    public double getConnectDistance() {
        return connectDistance;
    }

    public void setConnectDistance(double connectDistance) {
        this.connectDistance = connectDistance;
    }
    
    public Graph get() {
        double x0 = bounds.getX(), y0 = bounds.getY(), x1 = bounds.getMaxX(), y1 = bounds.getMaxY();
        List pts = new ArrayList();
        for (int i = 0; i < nodes; i++) {
            pts.add(new Point2D.Double(x0 + (x1 - x0) * Math.random(), y0 + (y1 - y0) * Math.random()));
        }
        List edges = new ArrayList();
        for (int i0 = 0; i0 < pts.size(); i0++) {
            for (int i1 = i0+1; i1 < pts.size(); i1++) {
                if (pts.get(i0).distance(pts.get(i1)) > connectDistance) {
                    continue;
                }
                edges.add(new Point2D.Double[]{pts.get(i0), pts.get(i1)});
            }
        }
        return SparseGraph.createFromArrayEdges(false, pts, edges);
    }

}