From 661e09f4f290c8e52429051f873a781b146c18e8 Mon Sep 17 00:00:00 2001
From: David <dgleich@stanford.edu>
Date: Fri, 15 May 2009 22:51:30 -0700
Subject: [PATCH] Unknown change looks like comment line wrap

---
 scomponents.m | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/scomponents.m b/scomponents.m
index e3f9a68..3cf27ac 100644
--- a/scomponents.m
+++ b/scomponents.m
@@ -7,10 +7,9 @@
 % connected components.  Otherwise, it output the strongly connected
 % components.
 %
-% 
-%
-% The implement is from Tarjan's 1972 paper: Depth-first search and linear 
-% graph algorithms. In SIAM's Journal of Computing, 1972, 1, pp.146-160.
+% The implementation is from Tarjan's 1972 paper: Depth-first search and 
+% linear graph algorithms. In SIAM's Journal of Computing, 1972, 1, 
+% pp.146-160.
 %
 % See also DMPERM
 %
@@ -22,7 +21,6 @@
 %   CG = R'*A*R;                  % create the graph with each component 
 %                                 % collapsed into a single node.
 
-
 % David Gleich
 % Copyright, Stanford University, 2008