svn commit: r1295451 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java

[si...@apache.org]

Author: simonetripodi
Date: Thu Mar  1 07:56:25 2012
New Revision: 1295451

URL: http://svn.apache.org/viewvc?rev=1295451&view=rev
Log:
removed trailing spaces NO FUNCTIONAL CHANGES

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

Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java?rev=1295451&r1=1295450&r2=1295451&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/DefaultVisitAlgorithmsSelector.java Thu Mar  1 07:56:25 2012
@@ -121,21 +121,21 @@ final class DefaultVisitAlgorithmsSelect
             final E e = prevHead.equals( v ) ? null : graph.getEdge( prevHead, v );
 
             boolean skipVertex = false;
-            
+
             if ( e != null )
             {
                 if ( !handler.discoverEdge( prevHead, e, v ) )
                 {
                     skipVertex = true;
                 }
-                
+
                 if ( handler.finishEdge( prevHead, e, v ) )
                 {
                     skipVertex = true;
                     visitingGraph = false;
                 }
             }
-            
+
             if ( !skipVertex && handler.discoverVertex( v ) )
             {
                 Iterator<V> connected = ( graph instanceof DirectedGraph ) ?
@@ -156,7 +156,7 @@ final class DefaultVisitAlgorithmsSelect
             if ( !skipVertex && handler.finishVertex( v ) )
             {
                 visitingGraph = false;
-            }            
+            }
         }
 
         handler.finishGraph( graph );
@@ -168,7 +168,7 @@ final class DefaultVisitAlgorithmsSelect
      * A wrapper class around a {@link LinkedList} to provide a common
      * interface for {@link Stack} or {@link Queue} implementations. The class
      * is used to support a common algorithm for depth-first and breadth-first
-     * search, by switching from queue (FIFO) to stack (LIFO) behavior. 
+     * search, by switching from queue (FIFO) to stack (LIFO) behavior.
      *
      * @param <V> the Graph vertices type
      */
@@ -178,7 +178,7 @@ final class DefaultVisitAlgorithmsSelect
         private boolean isQueue;
         /** the underlying linked list implementation. */
         private LinkedList<P> list;
-        
+
         /**
          * Create a new {@link QueueOrStack} instance with the desired
          * behavior, indicated by <code>isQueue</code>.
@@ -191,7 +191,7 @@ final class DefaultVisitAlgorithmsSelect
             this.isQueue = isQueue;
             this.list = new LinkedList<P>();
         }
-        
+
         /**
          * Add an element to the collection.
          *
@@ -201,7 +201,7 @@ final class DefaultVisitAlgorithmsSelect
         {
             list.addLast( element );
         }
-        
+
         /**
          * Removes and returns the element from the collection according to the
          * defined behavior (LIFO vs. FIFO).
@@ -212,12 +212,12 @@ final class DefaultVisitAlgorithmsSelect
         {
             return isQueue ? list.removeFirst() : list.removeLast();
         }
-        
+
         /**
          * Returns <code>true</code> if the collection contains no elements.
          * @return <code>true</code> if the collection is empty, <code>false</code> otherwise
          */
-        public boolean isEmpty() 
+        public boolean isEmpty()
         {
             return list.isEmpty();
         }