DefaultGraph.java
/*
* Copyright 2006 - 2013
* Stefan Balev <stefan.balev@graphstream-project.org>
* Julien Baudry <julien.baudry@graphstream-project.org>
* Antoine Dutot <antoine.dutot@graphstream-project.org>
* Yoann Pigné <yoann.pigne@graphstream-project.org>
* Guilhelm Savin <guilhelm.savin@graphstream-project.org>
*
* This file is part of GraphStream <http://graphstream-project.org>.
*
* GraphStream is a library whose purpose is to handle static or dynamic
* graph, create them from scratch, file or any source and display them.
*
* This program is free software distributed under the terms of two licenses, the
* CeCILL-C license that fits European law, and the GNU Lesser General Public
* License. You can use, modify and/ or redistribute the software under the terms
* of the CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
* URL <http://www.cecill.info> or under the terms of the GNU LGPL 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL-C and LGPL licenses and that you accept their terms.
*/
package org.graphstream.graph.implementations;
/**
* Default implementation of graph. This is just a synonym of {@link SingleGraph}. It is here for clarity only.
*
*/
public class DefaultGraph extends SingleGraph {
/**
* Creates an empty graph.
*
* @param id
* Unique identifier of the graph.
* @param strictChecking
* If true any non-fatal error throws an exception.
* @param autoCreate
* If true (and strict checking is false), nodes are
* automatically created when referenced when creating a edge,
* even if not yet inserted in the graph.
* @param initialNodeCapacity
* Initial capacity of the node storage data structures. Use this
* if you know the approximate maximum number of nodes of the
* graph. The graph can grow beyond this limit, but storage
* reallocation is expensive operation.
* @param initialEdgeCapacity
* Initial capacity of the edge storage data structures. Use this
* if you know the approximate maximum number of edges of the
* graph. The graph can grow beyond this limit, but storage
* reallocation is expensive operation.
*/
public DefaultGraph(String id, boolean strictChecking, boolean autoCreate,
int initialNodeCapacity, int initialEdgeCapacity) {
super(id, strictChecking, autoCreate, initialNodeCapacity,
initialEdgeCapacity);
}
/**
* Creates an empty graph with default edge and node capacity.
*
* @param id
* Unique identifier of the graph.
* @param strictChecking
* If true any non-fatal error throws an exception.
* @param autoCreate
* If true (and strict checking is false), nodes are
* automatically created when referenced when creating a edge,
* even if not yet inserted in the graph.
*/
public DefaultGraph(String id, boolean strictChecking, boolean autoCreate) {
super(id, strictChecking, autoCreate);
}
/**
* Creates an empty graph with strict checking and without auto-creation.
*
* @param id
* Unique identifier of the graph.
*/
public DefaultGraph(String id) {
super(id);
}
}