Author: simonetripodi
Date: Wed Oct 26 12:24:56 2011
New Revision: 1189168
URL: http://svn.apache.org/viewvc?rev=1189168&view=rev
Log:
first checkin of RevertedGraph class
Added:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
(with props)
Added:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java?rev=1189168&view=auto
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
(added)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
Wed Oct 26 12:24:56 2011
@@ -0,0 +1,157 @@
+package org.apache.commons.graph.model;
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+import org.apache.commons.graph.DirectedGraph;
+import org.apache.commons.graph.Edge;
+import org.apache.commons.graph.Vertex;
+import org.apache.commons.graph.VertexPair;
+
+/**
+ * An adapted class that mirrors {@link DirectedGraph} instances,
+ * inverting vertices relationships.
+ *
+ * It is useful for algorithms such as Kosaraju-Sharir for strongly connected
components search.
+ *
+ * @param <V> the Graph vertices type
+ * @param <E> the Graph edges type
+ */
+public final class RevertedGraph<V extends Vertex, E extends Edge>
+ implements DirectedGraph<V, E>
+{
+
+ /**
+ * The DirectedGraph has to be adapted.
+ */
+ private final DirectedGraph<V, E> directedGraph;
+
+ /**
+ * Build a new DirectedGraph mirror.
+ *
+ * @param directedGraph the DirectedGraph has to be adapted
+ */
+ public RevertedGraph( DirectedGraph<V, E> directedGraph )
+ {
+ if ( directedGraph == null )
+ {
+ throw new IllegalArgumentException( "Adapted DirectedGraph must be
not null" );
+ }
+
+ this.directedGraph = directedGraph;
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public Iterable<V> getVertices()
+ {
+ return directedGraph.getVertices();
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public int getOrder()
+ {
+ return directedGraph.getOrder();
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public Iterable<E> getEdges()
+ {
+ return directedGraph.getEdges();
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public int getSize()
+ {
+ return directedGraph.getSize();
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public int getDegree( V v )
+ {
+ return directedGraph.getDegree( v );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public Iterable<V> getConnectedVertices( V v )
+ {
+ return directedGraph.getConnectedVertices( v );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public E getEdge( V source, V target )
+ {
+ return directedGraph.getEdge( target, source );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public VertexPair<V> getVertices( E e )
+ {
+ VertexPair<V> directedVertexPair = directedGraph.getVertices( e );
+ return new VertexPair<V>( directedVertexPair.getTail(),
directedVertexPair.getHead() );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public int getInDegree( V v )
+ {
+ return directedGraph.getOutDegree( v );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public Iterable<V> getInbound( V v )
+ {
+ return directedGraph.getOutbound( v );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public int getOutDegree( V v )
+ {
+ return directedGraph.getOutDegree( v );
+ }
+
+ /**
+ * {@inheritDoc}
+ */
+ public Iterable<V> getOutbound( V v )
+ {
+ return directedGraph.getInbound( v );
+ }
+
+}
\ No newline at end of file
Propchange:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
------------------------------------------------------------------------------
svn:eol-style = native
Propchange:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
------------------------------------------------------------------------------
svn:keywords = Date Author Id Revision HeadURL
Propchange:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/RevertedGraph.java
------------------------------------------------------------------------------
svn:mime-type = text/plain
