Daniel@0: function graph_to_dot(adj, varargin)
Daniel@0: %GRAPH_TO_DOT  Makes a GraphViz (AT&T) file representing an adjacency matrix
Daniel@0: % graph_to_dot(adj, ...) writes to the specified filename.
Daniel@0: %
Daniel@0: % Optional arguments can be passed as name/value pairs: [default]
Daniel@0: %
Daniel@0: % 'filename' - if omitted, writes to 'tmp.dot'
Daniel@0: % 'arc_label' - arc_label{i,j} is a string attached to the i-j arc [""]
Daniel@0: % 'node_label' - node_label{i} is a string attached to the node i ["i"]
Daniel@0: % 'width'     - width in inches [10]
Daniel@0: % 'height'    - height in inches [10]
Daniel@0: % 'leftright' - 1 means layout left-to-right, 0 means top-to-bottom [0]
Daniel@0: % 'directed'  - 1 means use directed arcs, 0 means undirected [1]
Daniel@0: %
Daniel@0: % For details on graphviz, See http://www.research.att.com/sw/tools/graphviz
Daniel@0: %
Daniel@0: % See also dot_to_graph and draw_dot.
Daniel@0: 
Daniel@0: % First version written by Kevin Murphy 2002.
Daniel@0: % Modified by Leon Peshkin, Jan 2004.
Daniel@0: % Bugfix by Tom Minka, Mar 2004.
Daniel@0:                    
Daniel@0: node_label = [];   arc_label = [];   % set default args
Daniel@0: width = 10;        height = 10;
Daniel@0: leftright = 0;     directed = 1;     filename = 'tmp.dot';
Daniel@0: 
Daniel@0: for i = 1:2:nargin-1                    % get optional args
Daniel@0:   switch varargin{i}
Daniel@0:     case 'filename', filename = varargin{i+1};
Daniel@0:     case 'node_label', node_label = varargin{i+1};
Daniel@0:     case 'arc_label', arc_label = varargin{i+1};
Daniel@0:     case 'width', width = varargin{i+1};
Daniel@0:     case 'height', height = varargin{i+1};
Daniel@0:     case 'leftright', leftright = varargin{i+1};
Daniel@0:     case 'directed', directed = varargin{i+1};
Daniel@0:   end
Daniel@0: end
Daniel@0: % minka
Daniel@0: if ~directed
Daniel@0:   adj = triu(adj | adj');
Daniel@0: end
Daniel@0: 
Daniel@0: fid = fopen(filename, 'w');
Daniel@0: if directed
Daniel@0:   fprintf(fid, 'digraph G {\n');
Daniel@0:   arctxt = '->'; 
Daniel@0:   if isempty(arc_label)
Daniel@0:     labeltxt = '';
Daniel@0:   else
Daniel@0:     labeltxt = '[label="%s"]';
Daniel@0:   end
Daniel@0: else
Daniel@0:   fprintf(fid, 'graph G {\n');
Daniel@0:   arctxt = '--'; 
Daniel@0:   if isempty(arc_label)
Daniel@0:     labeltxt = '[dir=none]';
Daniel@0:   else
Daniel@0:     labeltext = '[label="%s",dir=none]';
Daniel@0:   end
Daniel@0: end
Daniel@0: edgeformat = strcat(['%d ',arctxt,' %d ',labeltxt,';\n']);
Daniel@0: fprintf(fid, 'center = 1;\n');
Daniel@0: fprintf(fid, 'size=\"%d,%d\";\n', width, height);
Daniel@0: if leftright
Daniel@0:   fprintf(fid, 'rankdir=LR;\n');
Daniel@0: end
Daniel@0: Nnds = length(adj);
Daniel@0: for node = 1:Nnds               %  process nodes 
Daniel@0:   if isempty(node_label)
Daniel@0:     fprintf(fid, '%d;\n', node);
Daniel@0:   else
Daniel@0:     fprintf(fid, '%d [ label = "%s" ];\n', node, node_label{node});
Daniel@0:   end
Daniel@0: end
Daniel@0: for node1 = 1:Nnds   % process edges
Daniel@0:   arcs = find(adj(node1,:));         % children(adj, node);
Daniel@0:   for node2 = arcs
Daniel@0:     if  ~isempty(arc_label)
Daniel@0:       fprintf(fid, edgeformat,node1,node2,arc_label{node1,node2});
Daniel@0:     else
Daniel@0:       fprintf(fid, edgeformat, node1, node2);    
Daniel@0:     end    
Daniel@0:   end
Daniel@0: end
Daniel@0: fprintf(fid, '}');
Daniel@0: fclose(fid);