
org.jgrapht.generate.SimpleWeightedGraphMatrixGenerator Maven / Gradle / Ivy
/*
* (C) Copyright 2016-2021, by Barak Naveh and Contributors.
*
* JGraphT : a free Java graph-theory library
*
* See the CONTRIBUTORS.md file distributed with this work for additional
* information regarding copyright ownership.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License 2.0 which is available at
* http://www.eclipse.org/legal/epl-2.0, or the
* GNU Lesser General Public License v2.1 or later
* which is available at
* http://www.gnu.org/licenses/old-licenses/lgpl-2.1-standalone.html.
*
* SPDX-License-Identifier: EPL-2.0 OR LGPL-2.1-or-later
*/
package org.jgrapht.generate;
import org.jgrapht.*;
import java.util.*;
/**
* A simple weighted graph matrix generator.
*
* @param the graph vertex type
* @param the graph edge type
*/
public class SimpleWeightedGraphMatrixGenerator
implements
GraphGenerator
{
protected List vertices;
protected double[][] weights;
/**
* Set the generator vertices.
*
* @param vertices the graph vertices
* @return the generator
*/
public SimpleWeightedGraphMatrixGenerator vertices(List vertices)
{
this.vertices = vertices;
return this;
}
/**
* Set the weights of the generator.
*
* @param weights the weights
* @return the generator
*/
public SimpleWeightedGraphMatrixGenerator weights(double[][] weights)
{
this.weights = weights;
return this;
}
@Override
public void generateGraph(Graph target, Map resultMap)
{
if (weights == null) {
throw new IllegalArgumentException(
"Graph may not be constructed without weight-matrix specified");
}
if (vertices == null) {
throw new IllegalArgumentException(
"Graph may not be constructed without vertex-set specified");
}
assert vertices.size() == weights.length;
for (V vertex : vertices) {
target.addVertex(vertex);
}
for (int i = 0; i < vertices.size(); ++i) {
assert vertices.size() == weights[i].length;
for (int j = 0; j < vertices.size(); ++j) {
if (i != j) {
target
.setEdgeWeight(
target.addEdge(vertices.get(i), vertices.get(j)), weights[i][j]);
}
}
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy