/*

     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 19.03.2005

  *

  */

 package net.sourceforge.combean.adapters.drasys.graph;

 import drasys.or.graph.AddEdgeI;

 import drasys.or.graph.AddVertexI;

 import drasys.or.graph.DuplicateEdgeException;

 import drasys.or.graph.DuplicateVertexException;

 import drasys.or.graph.GraphI;

 import drasys.or.graph.VertexNotFoundException;

 /**

  * @author schickin

  *

  */

 public class DRAGraphUtils {

     public static void addNumberedVertices(AddVertexI g, int from, int to)

     throws DuplicateVertexException {

         for (int i = from; i <= to; i++) {

             g.addVertex(new Integer(i));

         }

     }

     public static void addNumberedPath(AddEdgeI g, int[] path,

             boolean isDirected)

     throws DuplicateEdgeException, VertexNotFoundException {

         for (int i = 0; i < path.length-1; i++) {

             g.addEdge(new Integer(path[i]), new Integer(path[i+1]),

                     null, isDirected);

         }

     }

     public static void addNumberedPath(AddEdgeI g, int from, int to,

             boolean isDirected)

     throws DuplicateEdgeException, VertexNotFoundException {

         int[] path = new int[to-from+1];

         for (int i = from; i <= to; i++) {

             path[i-from] = i;

         }

         addNumberedPath(g, path, isDirected);

     }

     public static void addNumberedCycle(AddEdgeI g, int from, int to,

             boolean isDirected)

     throws DuplicateEdgeException, VertexNotFoundException {

         addNumberedPath(g, from, to, isDirected);

         g.addEdge(new Integer(to), new Integer(from), null, isDirected);

     }

     public static DRAGraphVertexAsNode getVertexByNumber(GraphI g, int vertexNum) {

         return new DRAGraphVertexAsNode(g.getVertex(new Integer(vertexNum)));

     }

 }