/*

     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 java.util.Enumeration;

 import net.sourceforge.combean.graph.iterators.CombinedPairEdgeIterator;

 import net.sourceforge.combean.interfaces.graph.Edge;

 import net.sourceforge.combean.interfaces.graph.EdgeIterator;

 import net.sourceforge.combean.interfaces.graph.Graph;

 import net.sourceforge.combean.interfaces.graph.Node;

 import net.sourceforge.combean.interfaces.graph.NodeIterator;

 import net.sourceforge.combean.interfaces.graph.prop.DirectedEdgeNeighborhoodGraphProp;

 import net.sourceforge.combean.interfaces.graph.prop.GlobalEdgesGraphProp;

 import net.sourceforge.combean.interfaces.graph.prop.GlobalNodesGraphProp;

 import drasys.or.graph.EdgeI;

 import drasys.or.graph.GraphI;

 import drasys.or.graph.SparseGraph;

 import drasys.or.graph.VertexI;

 /**

  * @author schickin

  *

  */

 public class DRAGraphAsGraph implements

 Graph,

 DirectedEdgeNeighborhoodGraphProp,

 GlobalEdgesGraphProp,

 GlobalNodesGraphProp {

     private GraphI draGraph = null;

     public DRAGraphAsGraph() {

         super();

         this.draGraph = new SparseGraph();

     }

     /**

      * 

      */

     public DRAGraphAsGraph(GraphI draGraph) {

         super();

         this.draGraph = draGraph;

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.Graph#getNodeClass()

      */

     public Class getNodeClass() {

          return DRAGraphVertexAsNode.class;

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.Graph#getEdgeClass()

      */

     public Class getEdgeClass() {

         return DRAGraphEdgeAsEdge.class;

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.GlobalEdgesGraphProp#getAllEdgesIterator()

      */

     public final EdgeIterator getAllEdgesIterator() {

          return convertToEdgeIterator(this.draGraph.edges());

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.GlobalEdgesGraphProp#getNumEdges()

      */

     public final int getNumEdges() {

          return this.draGraph.sizeOfEdges();

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.GlobalNodesGraphProp#getAllNodesIterator()

      */

     public final NodeIterator getAllNodesIterator() {

         return convertToNodeIterator(this.draGraph.vertices());

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.GlobalNodesGraphProp#getNumNodes()

      */

     public final int getNumNodes() {

          return this.draGraph.sizeOfVertices();

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.OutgoingEdgeNeighborhoodGraphProp#getOutgoingEdges(net.sourceforge.combean.interfaces.graph.Node)

      */

     public final EdgeIterator getOutgoingEdges(Node v) {

          return convertToEdgeIterator(

                  ((DRAGraphVertexAsNode) v).getVertexI().outEdges());

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.IncomingEdgeNeighborhoodGraphProp#getIncomingEdges(net.sourceforge.combean.interfaces.graph.Node)

      */

     public final EdgeIterator getIncomingEdges(Node v) {

         return convertToEdgeIterator(

                 ((DRAGraphVertexAsNode) v).getVertexI().inEdges());

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.NeighborhoodGraphProp#getFirstNode(net.sourceforge.combean.interfaces.graph.Edge)

      */

     public final Node getFirstNode(Edge e) {

          return convertToNode(

                  ((DRAGraphEdgeAsEdge) e).getEdgeI().getFromVertex());

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.NeighborhoodGraphProp#getIncidentEdges(net.sourceforge.combean.interfaces.graph.Node)

      */

     public final EdgeIterator getIncidentEdges(Node v) {

         return new CombinedPairEdgeIterator(

                 convertToEdgeIterator(

                         ((DRAGraphVertexAsNode) v).getVertexI().inEdges()),

                 convertToEdgeIterator(

                         ((DRAGraphVertexAsNode) v).getVertexI().outEdges()));

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.NeighborhoodGraphProp#getOtherNode(net.sourceforge.combean.interfaces.graph.Edge, net.sourceforge.combean.interfaces.graph.Node)

      */

     public final Node getOtherNode(Edge e, Node v) {

         Node first = getFirstNode(e);

         if (first.equals(v)) {

             return getSecondNode(e);

         }

         return first;

     }

     /* (non-Javadoc)

      * @see net.sourceforge.combean.interfaces.graph.NeighborhoodGraphProp#getSecondNode(net.sourceforge.combean.interfaces.graph.Edge)

      */

     public final Node getSecondNode(Edge e) {

         return convertToNode(

                 ((DRAGraphEdgeAsEdge) e).getEdgeI().getToVertex());

     }

     /**

      * @return Returns the draGraph.

      */

     public final GraphI getDraGraph() {

         return this.draGraph;

     }

     public final Object getEdgeValue(Edge e) {

         return ((DRAGraphEdgeAsEdge) e).getEdgeI().getValue();

     }

     protected Node convertToNode(VertexI draVertex) {

         return new DRAGraphVertexAsNode(draVertex);

     }

     protected Edge convertToEdge(EdgeI draEdge) {

         return new DRAGraphEdgeAsEdge(draEdge);

     }

     private NodeIterator convertToNodeIterator(Enumeration draVertexEnum) {

         return new DRAGraphNodeIterator(draVertexEnum, this);

     }

     private EdgeIterator convertToEdgeIterator(Enumeration draEdgeEnum) {

         return new DRAGraphEdgeIterator(draEdgeEnum, this);

     }

 }