lib/plexus/undirected_graph/algorithms.rb in plexus-0.5.5 vs lib/plexus/undirected_graph/algorithms.rb in plexus-0.5.6

@@ -18,11 +18,11 @@
       # UndirectedGraph uses Edge for the edge class.
       def edge_class() @parallel_edges ? Plexus::MultiEdge : Plexus::Edge; end
 
       def remove_edge!(u, v=nil)
         unless u.kind_of? Plexus::Arc
-          raise ArgumentError if @parallel_edges 
+          raise ArgumentError if @parallel_edges
           u = edge_class[u,v]
         end
         super(u.reverse) unless u.source == u.target
         super(u)
       end
@@ -47,10 +47,10 @@
         true
       end
 
       def chromatic_number
         return triangulated_chromatic_number if triangulated?
-        raise NotImplementedError    
+        raise NotImplementedError
       end
 
       # An interval graph can have its vertices into one-to-one
       # correspondence with a set of intervals F of a linearly ordered
       # set (like the real line) such that two vertices are connected