1 /* ========================================== 2 * JGraphT : a free Java graph-theory library 3 * ========================================== 4 * 5 * Project Info: http://jgrapht.sourceforge.net/ 6 * Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh) 7 * 8 * (C) Copyright 2003-2006, by Barak Naveh and Contributors. 9 * 10 * This library is free software; you can redistribute it and/or modify it 11 * under the terms of the GNU Lesser General Public License as published by 12 * the Free Software Foundation; either version 2.1 of the License, or 13 * (at your option) any later version. 14 * 15 * This library is distributed in the hope that it will be useful, but 16 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 17 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public 18 * License for more details. 19 * 20 * You should have received a copy of the GNU Lesser General Public License 21 * along with this library; if not, write to the Free Software Foundation, 22 * Inc., 23 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. 24 */ 25 /* -------------------- 26 * UndirectedGraph.java 27 * -------------------- 28 * (C) Copyright 2003-2006, by Barak Naveh and Contributors. 29 * 30 * Original Author: Barak Naveh 31 * Contributor(s): Christian Hammer 32 * 33 * $Id: UndirectedGraph.java 504 2006-07-03 02:37:26Z perfecthash $ 34 * 35 * Changes 36 * ------- 37 * 24-Jul-2003 : Initial revision (BN); 38 * 11-Mar-2004 : Made generic (CH); 39 * 40 */ 41 package org.jgrapht; 42 43 /** 44 * A graph whose all edges are undirected. This is the root interface of all 45 * undirected graphs. 46 * 47 * <p>See <a HREF="http://mathworld.wolfram.com/Graph.html"> 48 * http://mathworld.wolfram.com/Graph.html</a> for more on undirected and on 49 * directed graphs.</p> 50 * 51 * @author Barak Naveh 52 * @since Jul 14, 2003 53 */ 54 public interface UndirectedGraph<V, E> 55 extends Graph<V, E> 56 { 57 58 //~ Methods --------------------------------------------------------------- 59 60 /** 61 * Returns the degree of the specified vertex. A degree of a vertex in an 62 * undirected graph is the number of edges touching that vertex. 63 * 64 * @param vertex vertex whose degree is to be calculated. 65 * 66 * @return the degree of the specified vertex. 67 */ 68 public int degreeOf(V vertex); 69 } 70