X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=unit-tests%2Ftests-in-progress.lisp;fp=unit-tests%2Ftests-in-progress.lisp;h=335f060385d927a8c9a4b06575dda2a58ab60f16;hb=09ba252fcab440337424122782e305db8f585e83;hp=0000000000000000000000000000000000000000;hpb=2926febda5cac7ca367cdeccb934d54e146c3702;p=cl-graph.git

diff --git a/unit-tests/tests-in-progress.lisp b/unit-tests/tests-in-progress.lisp
new file mode 100644
index 0000000..335f060
--- /dev/null
+++ b/unit-tests/tests-in-progress.lisp
@@ -0,0 +1,51 @@
+(in-package cl-graph)
+
+(defun foo ()
+  (let ((graph (cl-graph:make-graph 'cl-graph:graph-container 
+				    :vertex-test #'equal)))
+    (cl-graph:add-vertex graph "a")
+    (cl-graph:add-vertex graph "b")
+    (cl-graph:add-vertex graph "c")
+    (cl-graph:add-vertex graph "d")
+    (cl-graph:add-vertex graph "e")
+    (cl-graph:add-edge-between-vertexes graph "a" "b" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "b" "c" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "c" "a" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "d" "e" :edge-type :directed)
+    graph))
+
+(loop for component in 
+     (cl-graph:find-connected-components (foo)) 
+     for index from 1 do
+     (format t "~&Component ~D (~d node~:p and ~d edge~:p)" 
+	     index (vertex-count component) (edge-count component))
+     (iterate-edges component (lambda (edge)
+				(format t "~&  ~a to ~a" 
+					(source-vertex edge) 
+					(target-vertex edge))))
+     (format t "~%"))
+
+
+(defun mk-graph ()
+    (let ((graph (cl-graph:make-graph 'cl-graph:graph-container
+				    :vertex-test #'equal)))
+    (cl-graph:add-vertex graph "a")
+    (cl-graph:add-vertex graph "b")
+    (cl-graph:add-vertex graph "c")
+    (cl-graph:add-vertex graph "d")
+    (cl-graph:add-vertex graph "e")
+    (cl-graph:add-edge-between-vertexes graph "a" "b" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "b" "c" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "c" "a" :edge-type :directed)
+    (cl-graph:add-edge-between-vertexes graph "d" "e" :edge-type :directed)
+    graph))
+
+(mk-graph)
+
+(setf *g* (mk-graph))
+
+(mapcar (lambda (v)
+	  (list v (cl-graph:in-cycle-p *g* v)))
+	(cl-graph:vertexes *g*))
+
+(car (cl-graph:vertexes *g*))