|#
-(in-package metabang.graph)
+(in-package #:metabang.graph)
;; TODO these are hacks to be removed later,
;; the functionality should be provided by graph itself
(args (list dot
:graph-visitor
(lambda (dot-graph)
- (setf (dot-attribute :bb g)
- (graphviz:graph-bounding-box dot-graph)))
+ (setf (dot-attribute-value :bb g)
+ (graphviz:graph-bounding-box dot-graph)))
:node-visitor
(lambda (node)
;; TODO search-for-vertex is sloooow, use a hashtable or
;; introduce an graph-find-element-by-id-mixin, or similar
(let ((vertex (find-vertex-by-id g (graphviz:node-name node))))
- (setf (dot-attribute :pos vertex) pos)
- (setf (dot-attribute :width vertex) width)
- (setf (dot-attribute :height vertex) height))))
+ (setf (dot-attribute-value :pos vertex) pos
+ (dot-attribute-value :width vertex) width
+ (dot-attribute-value :height vertex) height))))
:edge-visitor
(lambda (edge)
(to-vertex (find-vertex-by-id g (graphviz:node-name to)))
(real-edge (find-edge-between-vertexes g from-vertex to-vertex))
(bezier-points '()))
- (graphviz:edge-iterate-beziers
+ (graphviz:iterate-edge-beziers
edge
(lambda (bezier)
;;(format t " Bezier: ~a~%"
;; (graphviz:bezier-points bezier))
(dolist (el (graphviz:bezier-points bezier))
(push el bezier-points))))
- (setf (dot-attribute :pos real-edge) (nreverse bezier-points))))))))
+ (setf (dot-attribute-value :pos real-edge)
+ (nreverse bezier-points))))))))
(when algorithm-provided-p
(nconc args (list :algorithm algorithm)))
(apply 'graphviz:layout-dot-format args))