Miscellaneous

darcs-hash:20080928192737-3cc5d-534ce56c684e62b267332754f6911e28860e548e.gz

diff --git a/dev/graph-algorithms.lisp b/dev/graph-algorithms.lisp
index 2455e18..bd52fca 100644 (file)
--- a/dev/graph-algorithms.lisp
+++ b/dev/graph-algorithms.lisp
@@ -262,7 +262,7 @@
 
 ;;; ---------------------------------------------------------------------------
 
-#+ignore ;;; shit
+#+ignore ;;; shoot
 (defmethod minimum-spanning-tree ((vertex-list list) 
                                   &key
                                   (edge-sorter #'edge-lessp-by-weight))
@@ -273,9 +273,7 @@
     (iterate-container
      vertex-list
      (lambda (v)
-       (mst-make-set v)))
-    
-    
+       (mst-make-set v)))    
     
     (loop for edge in (sort v-edges edge-sorter) do
           (bind ((v1 (source-vertex edge))

diff --git a/dev/graph.lisp b/dev/graph.lisp
index 8531652..2625aab 100644 (file)
--- a/dev/graph.lisp
+++ b/dev/graph.lisp
@@ -198,7 +198,8 @@ something is putting something on the vertexes plist's
 ;;; internals 
 ;;; ---------------------------------------------------------------------------
 
-(defmethod add-vertex ((graph basic-graph) (value basic-vertex) &key if-duplicate-do)
+(defmethod add-vertex
+    ((graph basic-graph) (value basic-vertex) &key if-duplicate-do)
   (declare (ignore if-duplicate-do))
   (values value))
 
@@ -1025,7 +1026,8 @@ length"
 
 ;;; ---------------------------------------------------------------------------
 
-(defun map-shortest-paths (graph start-vertex depth fn &key (filter (constantly t)))
+(defun map-shortest-paths
+    (graph start-vertex depth fn &key (filter (constantly t)))
   "Apply fn to each shortest path starting at `start-vertex` of depth `depth`. The `filter` predicate is used to remove vertexes from consideration."
   (bind ((visited (make-container 'simple-associative-container
                                   :test #'equal)))