/*

     This file is part of Combean.

     Combean is free software; you can redistribute it and/or modify

     it under the terms of the GNU General Public License as published by

     the Free Software Foundation; either version 2 of the License, or

     (at your option) any later version.

     Combean 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 General Public License for more details.

     You should have received a copy of the GNU General Public License

     along with Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 06.01.2005

  *

  */

 package net.sourceforge.combean.samples.simplegraphs;

 /**

  * @author schickin

  *

  */

 public class Path extends SimpleNumberGraph {

         /**

          * Construct a path of the given size.

          * 

          * @param size the length of the path

          */

         public Path(int size) {

                 super(size);

         }

         /**

          * @see net.sourceforge.combean.samples.simplegraphs.NumberGraph#calcNextNode(int, int)

          */

         protected int calcNextNode(int sourceNodeNum, int minNodeNum) {

                 int result = NOSUCHNODE;

                 if (minNodeNum <= sourceNodeNum-1) {

                         result = sourceNodeNum-1;

                 }

         else if (minNodeNum <= sourceNodeNum+1) {

                         result = sourceNodeNum+1;

         }

         if (result >= getNumNodes()) {

                 result = NOSUCHNODE;

         }

         return result;

         }

 }