/* ========================================== * JGraphT : a free Java graph-theory library * ========================================== * * Project Info: http://jgrapht.sourceforge.net/ * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh) * * (C) Copyright 2003-2007, by Barak Naveh and Contributors. * * This library is free software; you can redistribute it and/or modify it * under the terms of the GNU Lesser General Public License as published by * the Free Software Foundation; either version 2.1 of the License, or * (at your option) any later version. * * This library 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 library; if not, write to the Free Software Foundation, * Inc., * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. */ /* ---------------- * SimpleGraph.java * ---------------- * (C) Copyright 2003-2007, by Barak Naveh and Contributors. * * Original Author: Barak Naveh * Contributor(s): CHristian Hammer * * $Id: SimpleGraph.java 568 2007-09-30 00:12:18Z perfecthash $ * * Changes * ------- * 05-Aug-2003 : Initial revision (BN); * 06-Aug-2005 : Made generic (CH); * 28-May-2006 : Moved connectivity info from edge to graph (JVS); * */ package org.jgrapht.graph; import org.jgrapht.*; /** * A simple graph. A simple graph is an undirected graph for which at most one * edge connects any two vertices, and loops are not permitted. If you're unsure * about simple graphs, see: <a * href="http://mathworld.wolfram.com/SimpleGraph.html"> * http://mathworld.wolfram.com/SimpleGraph.html</a>. */ public class SimpleGraph<V, E> extends AbstractBaseGraph<V, E> implements UndirectedGraph<V, E> { //~ Static fields/initializers --------------------------------------------- private static final long serialVersionUID = 3545796589454112304L; //~ Constructors ----------------------------------------------------------- /** * Creates a new simple graph with the specified edge factory. * * @param ef the edge factory of the new graph. */ public SimpleGraph(EdgeFactory<V, E> ef) { super(ef, false, false); } /** * Creates a new simple graph. * * @param edgeClass class on which to base factory for edges */ public SimpleGraph(Class<? extends E> edgeClass) { this(new ClassBasedEdgeFactory<V, E>(edgeClass)); } } // End SimpleGraph.java