org.jgrapht.nio.gexf.SimpleGEXFImporter Maven / Gradle / Ivy
/*
* (C) Copyright 2020-2023, by Dimitrios Michail 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.nio.gexf;
import org.jgrapht.*;
import org.jgrapht.alg.util.*;
import org.jgrapht.nio.*;
import java.io.*;
import java.util.*;
import java.util.function.*;
/**
* Imports a graph from a GEXF data source.
*
*
* This is a simple implementation with supports only a limited set of features of the GEXF
* specification, oriented towards parsing speed.
*
*
* The importer uses the graph suppliers ({@link Graph#getVertexSupplier()} and
* {@link Graph#getEdgeSupplier()}) in order to create new vertices and edges. Moreover, it notifies
* lazily and completely out-of-order for any additional vertex, edge or graph attributes in the
* input file. Users can register consumers for vertex, edge and graph attributes after construction
* of the importer. Finally, default attribute values and any nested elements are completely
* ignored.
*
*
* For a description of the format see
* https://gephi.org/gexf/format/index.html or the
* GEXF Primer.
*
*
*
* Below is small example of a graph in GEXF format.
*
*
* {@code
*
*
*
*
*
*
*
*
*
* }
*
*
*
* The importer reads the input into a graph which is provided by the user. In case the graph is
* weighted and the corresponding edge attribute "weight" is defined, the importer also reads edge
* weights. Otherwise edge weights are ignored. To test whether the graph is weighted, method
* {@link Graph#getType()} can be used.
*
*
* The provided graph object, where the imported graph will be stored, must be able to support the
* features of the graph that is read. For example if the GEXF file contains self-loops then the
* graph provided must also support self-loops. The same for multiple edges. Moreover, the parser
* completely ignores the global attribute "defaultedgetype" and the edge attribute "type" which
* denotes whether an edge is directed or not. Whether edges are directed or not depends on the
* underlying implementation of the user provided graph object.
*
*
* The importer by default validates the input using the 1.2draft
* GEXF Schema. The user can (not
* recommended) disable the validation by calling {@link #setSchemaValidation(boolean)}. Older
* schemas are not supported.
*
*
* The graph vertices and edges are build using the corresponding graph suppliers. The id of the
* vertices in the input file are reported as a vertex attribute named
* {@link #DEFAULT_VERTEX_ID_KEY}.
*
*
* The default behavior of the importer is to use the graph vertex supplier in order to create
* vertices. The user can also bypass vertex creation by providing a custom vertex factory method
* using {@link #setVertexFactory(Function)}. The factory method is responsible to create a new
* graph vertex given the vertex identifier read from file.
*
* @param the graph vertex type
* @param the graph edge type
*
* @author Dimitrios Michail
*/
public class SimpleGEXFImporter
extends BaseEventDrivenImporter
implements GraphImporter
{
/**
* Default key used for vertex ID.
*/
public static final String DEFAULT_VERTEX_ID_KEY = "ID";
private static final String WEIGHT = "weight";
private boolean schemaValidation;
private Function vertexFactory;
/**
* Constructs a new importer.
*/
public SimpleGEXFImporter()
{
super();
this.schemaValidation = true;
}
/**
* Whether the importer validates the input
*
* @return true if the importer validates the input
*/
public boolean isSchemaValidation()
{
return schemaValidation;
}
/**
* Set whether the importer should validate the input
*
* @param schemaValidation value for schema validation
*/
public void setSchemaValidation(boolean schemaValidation)
{
this.schemaValidation = schemaValidation;
}
/**
* Get the user custom vertex factory. This is null by default and the graph supplier is used
* instead.
*
* @return the user custom vertex factory
*/
public Function getVertexFactory()
{
return vertexFactory;
}
/**
* Set the user custom vertex factory. The default behavior is being null in which case the
* graph vertex supplier is used.
*
* If supplied the vertex factory is called every time a new vertex is encountered in the file.
* The method is called with parameter the vertex identifier from the file and should return the
* actual graph vertex to add to the graph.
*
* @param vertexFactory a vertex factory
*/
public void setVertexFactory(Function vertexFactory)
{
this.vertexFactory = vertexFactory;
}
/**
* Import a graph.
*
*
* The provided graph must be able to support the features of the graph that is read. For
* example if the GraphML file contains self-loops then the graph provided must also support
* self-loops. The same for multiple edges.
*
* @param graph the output graph
* @param input the input reader
* @throws ImportException in case an error occurs, such as I/O or parse error
*/
@Override
public void importGraph(Graph graph, Reader input)
{
SimpleGEXFEventDrivenImporter genericImporter = new SimpleGEXFEventDrivenImporter();
genericImporter.setSchemaValidation(schemaValidation);
Consumers globalConsumer = new Consumers(graph);
genericImporter.addGraphAttributeConsumer(globalConsumer.graphAttributeConsumer);
genericImporter.addVertexAttributeConsumer(globalConsumer.vertexAttributeConsumer);
genericImporter.addEdgeAttributeConsumer(globalConsumer.edgeAttributeConsumer);
genericImporter.addVertexConsumer(globalConsumer.vertexConsumer);
genericImporter.addEdgeConsumer(globalConsumer.edgeConsumer);
genericImporter.importInput(input);
}
private class Consumers
{
private Graph graph;
private Map nodesMap;
private E lastEdge;
private Triple lastTriple;
public Consumers(Graph graph)
{
this.graph = graph;
this.nodesMap = new HashMap<>();
this.lastEdge = null;
this.lastTriple = null;
}
public final BiConsumer graphAttributeConsumer = (key, a) -> {
notifyGraphAttribute(key, a);
};
public final BiConsumer, Attribute> vertexAttributeConsumer =
(vertexAndKey, a) -> {
notifyVertexAttribute(
mapNode(vertexAndKey.getFirst()), vertexAndKey.getSecond(), a);
};
public final BiConsumer, String>,
Attribute> edgeAttributeConsumer = (edgeAndKey, a) -> {
Triple qe = edgeAndKey.getFirst();
if (qe == lastTriple) {
if (qe.getThird() != null && WEIGHT.equals(edgeAndKey.getSecond())
&& graph.getType().isWeighted())
{
graph.setEdgeWeight(lastEdge, qe.getThird());
}
notifyEdgeAttribute(lastEdge, edgeAndKey.getSecond(), a);
}
};
public final Consumer vertexConsumer = (vId) -> {
V v = mapNode(vId);
notifyVertex(v);
notifyVertexAttribute(v, DEFAULT_VERTEX_ID_KEY, DefaultAttribute.createAttribute(vId));
};
public final Consumer> edgeConsumer = (qe) -> {
if (lastTriple != qe) {
String source = qe.getFirst();
String target = qe.getSecond();
Double weight = qe.getThird();
E e = graph.addEdge(mapNode(source), mapNode(target));
if (weight != null && graph.getType().isWeighted()) {
graph.setEdgeWeight(e, weight);
}
lastEdge = e;
lastTriple = qe;
notifyEdge(lastEdge);
}
};
private V mapNode(String vId)
{
V vertex = nodesMap.get(vId);
if (vertex == null) {
if (vertexFactory != null) {
vertex = vertexFactory.apply(vId);
graph.addVertex(vertex);
} else {
vertex = graph.addVertex();
}
nodesMap.put(vId, vertex);
}
return vertex;
}
}
}