Coverage Report - net.sourceforge.combean.samples.simplegraphs.Clique
 
Classes in this File Line Coverage Branch Coverage Complexity
Clique
100%
10/10
100%
6/6
2,5
 
 1  
 /*
 2  
     This file is part of Combean.
 3  
 
 4  
     Combean is free software; you can redistribute it and/or modify
 5  
     it under the terms of the GNU General Public License as published by
 6  
     the Free Software Foundation; either version 2 of the License, or
 7  
     (at your option) any later version.
 8  
 
 9  
     Combean is distributed in the hope that it will be useful,
 10  
     but WITHOUT ANY WARRANTY; without even the implied warranty of
 11  
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 12  
     GNU General Public License for more details.
 13  
 
 14  
     You should have received a copy of the GNU General Public License
 15  
     along with Combean; if not, write to the Free Software
 16  
     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 17  
 */
 18  
 /*
 19  
  * Created on 06.01.2005
 20  
  *
 21  
  */
 22  
 package net.sourceforge.combean.samples.simplegraphs;
 23  
 
 24  
 /**
 25  
  * This class represents a clique graph.
 26  
  * 
 27  
  * @author schickin
 28  
  *
 29  
  */
 30  
 public class Clique extends SimpleNumberGraph {
 31  
         
 32  
         /**
 33  
          * Construct a clique of the given size.
 34  
          * 
 35  
          * @param size
 36  
          */
 37  
         public Clique(int size) {
 38  42
                 super(size);
 39  42
         }
 40  
 
 41  
         /**
 42  
          * @see net.sourceforge.combean.samples.simplegraphs.NumberGraph#calcNextNode(int, int)
 43  
          */
 44  
         protected int calcNextNode(int sourceNodeNum, int minNodeNum) {
 45  
                 
 46  345
                 int nextNodeNum = 0;
 47  345
                 if (minNodeNum > 0) {
 48  261
                         nextNodeNum = minNodeNum;
 49  
                 }
 50  345
                 if (nextNodeNum == sourceNodeNum) {
 51  84
                         nextNodeNum++;
 52  
                 }
 53  345
                 if (nextNodeNum >= getNumNodes()) {
 54  69
                         nextNodeNum = NOSUCHNODE;
 55  
                 }
 56  
                 
 57  345
                 return nextNodeNum;
 58  
         }
 59  
 
 60  
 }