org.neo4j.gds.graphbuilder.CompleteGraphBuilder Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of test-utils Show documentation

Neo4j Graph Data Science :: Test Utils

There is a newer version: 2.11.0

/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j 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.
 *
 * This program 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 this program.  If not, see .
 */
package org.neo4j.gds.graphbuilder;

import org.neo4j.graphdb.Label;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.RelationshipType;
import org.neo4j.graphdb.Transaction;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;

/**
 * Builds a complete graph where all nodes are interconnected
 */
public class CompleteGraphBuilder extends GraphBuilder {

    CompleteGraphBuilder(Transaction tx, Label label, RelationshipType relationship, Random random) {
        super(tx, label, relationship, random);
    }

    public CompleteGraphBuilder createCompleteGraph(int nodeCount) {
        List nodes = new ArrayList<>();
        for (int i = 0; i < nodeCount; i++) {
            nodes.add(createNode());
        }
        for (int i = 0; i < nodeCount; i++) {
            for (int j = 0; j < nodeCount; j++) {
                if (i == j) {
                    continue;
                }
                createRelationship(nodes.get(i), nodes.get(j));
            }
        }
        return this;
    }


    public CompleteGraphBuilder createCompleteGraph(int nodeCount, double connectedness) {
        List nodes = new ArrayList<>();
        for (int i = 0; i < nodeCount; i++) {
            nodes.add(createNode());
        }
        for (int i = 0; i < nodeCount; i++) {
            for (int j = 0; j < nodeCount; j++) {
                if (i == j) {
                    continue;
                }
                if (randomDouble() < connectedness) {
                    createRelationship(nodes.get(i), nodes.get(j));
                }
            }
        }
        return this;
    }

    @Override
    protected CompleteGraphBuilder me() {
        return this;
    }
}