|#
-(in-package metabang.graph)
+(in-package #:metabang.graph)
;;; ---------------------------------------------------------------------------
;;; classes
;;; ---------------------------------------------------------------------------
-#+COPYING
-(defcopy-methods basic-vertex :copy-all t)
-
-;;; ---------------------------------------------------------------------------
-
(defmethod initialize-instance :after ((object basic-vertex) &key graph vertex-id)
(when (and graph (not vertex-id))
(setf (slot-value object 'vertex-id)
(color nil ia "The `color` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]"))
(:export-p t)
(:export-slots edge-id element tag color)
- #+COPYING :copy-slots
(:make-load-form-p t)
(:documentation "This is the root class for all edges in CL-Graph."))
;;; ---------------------------------------------------------------------------
-(defclass* directed-edge-mixin (#+COPYING copyable-mixin) ()
+(defclass* directed-edge-mixin () ()
(:export-p t)
(:documentation "This mixin class is used to indicate that an edge is directed."))
;;; ---------------------------------------------------------------------------
-(defclass* weighted-edge-mixin (#+COPYING copyable-mixin)
+(defclass* weighted-edge-mixin ()
((weight 1d0 ia "The value of the weight of this edge. Defaults to 1.0d0"))
- #+COPYING :copy-slots
:export-slots
(:export-p t)
(:documentation "This mixin class adds a `weight` slot to an edge."))
;;; ---------------------------------------------------------------------------
-(defclass* basic-graph (#+COPYING copyable-mixin)
+(defclass* basic-graph ()
((graph-vertexes :unbound ir)
(graph-edges :unbound ir)
(largest-vertex-id 0 r)
(defmethod print-object ((graph basic-graph) stream)
(print-unreadable-object (graph stream :type t :identity t)
- (format stream "~A" (size graph))))
+ (format stream "[~A,~A]" (size graph) (edge-count graph))))
;;; ---------------------------------------------------------------------------
&allow-other-keys)
(remf args :edge-class)
(remf args :edge-type)
-
- #| I removed 'em, gwk
-
- ;;; I added these - jjm
- (remf args :vertex-test)
- (remf args :vertex-key)
- (remf args :edge-key)
- (remf args :edge-test)
- (remf args :force-new?)
-
-|#
-
(assert (or (null edge-type)
(eq edge-type :directed)
(eq edge-type :undirected)) nil
:graph graph
:vertex-1 vertex-1 :vertex-2 vertex-2 args))
-
;;; ---------------------------------------------------------------------------
(defmethod make-graph ((graph-type symbol) &rest args &key &allow-other-keys)
(delete-item (graph-edges graph) edge)
edge)
+
+(defmethod delete-all-edges :after ((graph basic-graph))
+ (empty! (graph-edges graph))
+ graph)
+
;;; ---------------------------------------------------------------------------
(defmethod delete-vertex ((graph basic-graph) value-or-vertex)
(when error-if-not-found?
(error 'graph-vertex-not-found-in-edge-error :vertex value :edge edge)))
-;;; ---------------------------------------------------------------------------
-
-(defmethod search-for-vertex ((graph basic-graph) (value t)
- &key (key (vertex-key graph)) (test 'equal)
- (error-if-not-found? t))
- (aif (search-for-node graph value :test test :key key)
- it
- (when error-if-not-found?
- (error "~S not found in ~A using key ~S and test ~S" value graph key
- test))))
-
-;;; ---------------------------------------------------------------------------
(defmethod search-for-vertex ((graph basic-graph) (vertex basic-vertex)
&key (key (vertex-key graph)) (test 'equal)
(when error-if-not-found?
(error "~A not found in ~A" vertex graph))))
-;;; ---------------------------------------------------------------------------
-;; TODO !!! dispatch is the same as the second method above
(defmethod search-for-vertex ((graph basic-graph) (vertex t)
&key (key (vertex-key graph)) (test 'equal)
(error-if-not-found? t))
(when error-if-not-found?
(error "~A not found in ~A" vertex graph))))
-;;; ---------------------------------------------------------------------------
-
(defmethod iterate-elements ((graph basic-graph) fn)
(iterate-elements (graph-vertexes graph)
(lambda (vertex) (funcall fn (element vertex)))))
;;; ---------------------------------------------------------------------------
-#+COPYING
-(defmethod generate-directed-free-tree ((graph basic-graph) (root basic-vertex))
- (let ((new-graph (copy-top-level graph)))
- (empty! new-graph)
- (nilf (contains-undirected-edge-p new-graph))
- (neighbors-to-children new-graph root)
- (values new-graph)))
-
-;;; ---------------------------------------------------------------------------
-
(defmethod generate-directed-free-tree ((graph basic-graph) root)
(generate-directed-free-tree graph (find-vertex graph root)))
(defmethod make-filtered-graph ((old-graph basic-graph)
test-fn
- &optional
+ &key
(graph-completion-method nil)
- (depth nil))
- (let ((new-graph
- (copy-template old-graph)))
- (ecase graph-completion-method
- ((nil
- :complete-links)
- (iterate-vertexes old-graph
- (lambda (vertex)
- (when (funcall test-fn vertex)
- (add-vertex new-graph (value vertex))))))
- ((:complete-closure-nodes-only
- :complete-closure-with-links)
- (let* ((old-graph-vertexes (collect-items old-graph :filter test-fn))
- (closure-vertexes
- (get-transitive-closure old-graph-vertexes depth)))
- (dolist (vertex closure-vertexes)
- (add-vertex new-graph (copy-template vertex))))))
-
- (ecase graph-completion-method
+ (depth nil)
+ (new-graph
+ (copy-template old-graph)))
+ (ecase graph-completion-method
+ ((nil
+ :complete-links)
+ (iterate-vertexes old-graph
+ (lambda (vertex)
+ (when (funcall test-fn vertex)
+ (add-vertex new-graph (value vertex))))))
+ ((:complete-closure-nodes-only
+ :complete-closure-with-links)
+ (let* ((old-graph-vertexes (collect-items old-graph :filter test-fn))
+ (closure-vertexes
+ (get-transitive-closure old-graph-vertexes depth)))
+ (dolist (vertex closure-vertexes)
+ (add-vertex new-graph (copy-template vertex))))))
+ (ecase graph-completion-method
((nil :complete-closure-nodes-only) nil)
((:complete-links
:complete-closure-with-links)
(complete-links new-graph old-graph)))
-
- new-graph))
+ new-graph)
;;; ---------------------------------------------------------------------------
(defmethod subgraph-containing ((graph basic-graph) (vertex basic-vertex)
- &optional (depth nil))
- (make-filtered-graph graph
- #'(lambda (v)
- (equal v vertex))
- :complete-closure-with-links
- depth))
+ &rest args &key (depth nil) (new-graph nil))
+ (declare (ignore depth new-graph))
+ (apply #'make-filtered-graph
+ graph
+ #'(lambda (v)
+ (equal v vertex))
+ :graph-completion-method :complete-closure-with-links
+ args))
;;; ---------------------------------------------------------------------------
(defmethod edge-count ((graph basic-graph))
- (length (edges graph)))
+ (count-using #'iterate-edges nil graph))
;;; ---------------------------------------------------------------------------