Author: simonetripodi
Date: Sat Jun 11 14:17:00 2011
New Revision: 1134653

URL: http://svn.apache.org/viewvc?rev=1134653&view=rev
Log:
minor code format

Modified:
    
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/DirectedGraph.java

Modified: 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/DirectedGraph.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/DirectedGraph.java?rev=1134653&r1=1134652&r2=1134653&view=diff
==============================================================================
--- 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/DirectedGraph.java
 (original)
+++ 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/DirectedGraph.java
 Sat Jun 11 14:17:00 2011
@@ -28,25 +28,27 @@ import java.util.Set;
 public interface DirectedGraph
      extends Graph
 {
+
     /**
      * getInbound( Vertex ) Returns the set of edges which are inbound to the
      * Vertex.
      */
-    Set getInbound(Vertex v);
+    Set getInbound( Vertex v );
 
     /**
      * getOutbound( Vertex ) Returns the set of edges which lead away from the
      * Vertex.
      */
-    Set getOutbound(Vertex v);
+    Set getOutbound( Vertex v );
 
     /**
      * getSource( Edge ) Returns the vertex which originates the edge.
      */
-    Vertex getSource(Edge e);
+    Vertex getSource( Edge e );
 
     /**
      * getTarget( Edge ) Returns the vertex which terminates the edge.
      */
-    Vertex getTarget(Edge e);
+    Vertex getTarget( Edge e );
+
 }


Reply via email to