1 ;;;-*- Mode: Lisp; Package: metabang.graph -*-
5 $Id: graphviz-support.lisp,v 1.7 2005/06/21 20:51:51 moody Exp $
7 Copyright 1992 - 2005 Experimental Knowledge Systems Lab,
8 University of Massachusetts Amherst MA, 01003-4610
9 Professor Paul Cohen, Director
15 A color value can be a huesaturation-
16 brightness triple (three floating point numbers between 0 and 1, separated
17 by commas); one of the colors names listed in Appendix G (borrowed from
18 some version of the X window system); or a red-green-blue (RGB) triple4 (three
19 hexadecimal number between 00 and FF, preceded by the character Õ#Õ). Thus,
20 the values "orchid", "0.8396,0.4862,0.8549" and #DA70D6 are three
21 ways to specify the same color.
24 (in-package metabang.graph)
26 ;;; ---------------------------------------------------------------------------
28 ; This outputs the graph to string in accordance with the DOT file format.
29 ; For more information about DOT file format, search the web for "DOTTY" and
32 (defmethod graph->dot ((g basic-graph) (stream stream)
34 (graph-formatter 'graph->dot-properties)
35 (vertex-key 'vertex-id)
37 (vertex-formatter 'vertex->dot)
40 (edge-formatter 'edge->dot))
41 (format stream "~A G {~%graph " (if (contains-undirected-edge-p g) "graph" "digraph"))
43 (funcall graph-formatter g stream)
52 (let ((key (if vertex-key (funcall vertex-key v) v)))
56 (princ "label=\"" stream)
57 (funcall vertex-labeler v stream)
58 (princ "\", " stream))
59 (funcall vertex-formatter v stream)
62 (let ((directed-edge-connector (if (contains-undirected-edge-p g) "--" "->"))
63 (directed-edge-tag (when (and (contains-undirected-edge-p g)
64 (contains-directed-edge-p g))
66 (flet ((format-edge (e connector from to directed?)
68 (princ (funcall vertex-key from) stream)
69 (princ connector stream)
70 (princ (funcall vertex-key to) stream)
72 (when (and directed? directed-edge-tag)
73 (princ directed-edge-tag stream))
75 (princ "label=\"" stream)
76 (funcall edge-labeler e stream)
78 (funcall edge-formatter e stream)
87 (when (directed-edge-p e)
88 (format-edge e directed-edge-connector
89 (source-vertex e) (target-vertex e) t))))))
92 (let ((edges (make-container 'simple-associative-container)))
99 (when (and (undirected-edge-p e)
100 (not (item-at-1 edges e)))
101 (setf (item-at-1 edges e) t)
102 (format-edge e "--" (vertex-1 e) (vertex-2 e) nil)))))))))
111 (let ((g (make-container 'graph-container :default-edge-type :undirected)))
112 (loop for (a b) in '((a b) (b c) (b d) (d e) (e f) (d f)) do
113 (add-edge-between-vertexes g a b))
133 (let ((g (make-container 'graph-container :default-edge-type :directed)))
134 (loop for (a b) in '((a b) (b c) (b d) (d e) (e f) (d f)) do
135 (add-edge-between-vertexes g a b))
155 (let ((g (make-container 'graph-container)))
156 (loop for (a b) in '((d e) (e f) (d f)) do
157 (add-edge-between-vertexes g a b :edge-type :directed))
158 (loop for (a b) in '((a b) (b c) (b d)) do
159 (add-edge-between-vertexes g a b :edge-type :undirected))
178 ;;; ---------------------------------------------------------------------------
180 (defmethod graph->dot ((g basic-graph) (stream (eql nil))
181 &rest args &key &allow-other-keys)
182 (declare (dynamic-extent args))
183 (let ((out (make-string-output-stream)))
184 (apply #'graph->dot g out args)
185 (get-output-stream-string out)))
187 ;;; ---------------------------------------------------------------------------
189 (defmethod graph->dot ((g basic-graph) (stream (eql t))
190 &rest args &key &allow-other-keys)
191 (declare (dynamic-extent args))
192 (apply #'graph->dot g *standard-output* args))
194 ;;; ---------------------------------------------------------------------------
196 (defmethod graph->dot ((g basic-graph) (stream string)
197 &rest args &key &allow-other-keys)
198 (declare (dynamic-extent args))
199 (with-open-file (out stream :direction :output :if-exists :supersede)
200 (apply #'graph->dot g out args)))
202 ;;; ---------------------------------------------------------------------------
204 (defmethod graph->dot ((g basic-graph) (stream pathname)
205 &rest args &key &allow-other-keys)
206 (declare (dynamic-extent args))
207 (apply #'graph->dot g (namestring stream) args))
209 ;;; ---------------------------------------------------------------------------
211 (defmethod graph->dot-properties ((g t) (stream t))
214 ;;; ---------------------------------------------------------------------------
216 (defmethod vertex->dot ((v basic-vertex) (stream stream))
219 ;;; ---------------------------------------------------------------------------
221 (defmethod edge->dot ((v basic-edge) (stream stream))
224 ;;; ---------------------------------------------------------------------------
226 ;;; ---------------------------------------------------------------------------
229 (defmethod dot->graph ((dot-stream stream)
233 ;;; ---------------------------------------------------------------------------
235 (defmethod dot->graph ((dot-stream string)
236 &rest args &key &allow-other-keys)
237 (declare (dynamic-extent args))
238 (with-open-file (out stream :direction :output :if-exists :supersede)
239 (apply #'dot->graph g out args)))
241 ;;; ---------------------------------------------------------------------------
243 (defmethod dot->graph ((dot-stream pathname)
244 &rest args &key &allow-other-keys)
245 (declare (dynamic-extent args))
246 (with-open-file (out stream :direction :output :if-exists :supersede)
247 (apply #'dot->graph g out args))
248 (apply #'dot->graph g (namestring stream) args))