Daniel@0: function fg = mk_fgraph(G, node_sizes, factors, varargin)
Daniel@0: % MK_FGRAPH Make a factor graph
Daniel@0: % fg = mk_fgraph(G, node_sizes, factors, ...)
Daniel@0: %
Daniel@0: % A factor graph is a bipartite graph, with one side containing variables,
Daniel@0: % and the other containing functions of (subsets of) these variables.
Daniel@0: % For details, see "Factor Graphs and the Sum-Product Algorithm",
Daniel@0: %  F. Kschischang and B. Frey and H-A. Loeliger,
Daniel@0: %  IEEE Trans. Info. Theory, 2001
Daniel@0: %
Daniel@0: % G(i,j) = 1 if there is an arc from variable i to factor j
Daniel@0: %
Daniel@0: % node_sizes(i) is the number of values node i can take on,
Daniel@0: %   or the length of node i if i is a continuous-valued vector.
Daniel@0: %
Daniel@0: % 'factors' is the list of factors (kernel functions)
Daniel@0: %
Daniel@0: % The list below gives optional arguments [default value in brackets].
Daniel@0: % 
Daniel@0: % equiv_class - equiv_class(i)=j  means factor node i gets its params from factors{j} [1:F]
Daniel@0: % discrete - the list of nodes which are discrete random variables [1:N]
Daniel@0: %
Daniel@0: % e.g., fg = mk_fgraph(G, [2 2], {bnet.CPD{1},bnet.CPD{2}}, 'discrete', [1 2])
Daniel@0: 
Daniel@0: fg.G = G;
Daniel@0: fg.node_sizes = node_sizes;
Daniel@0: fg.factors = factors;
Daniel@0: [fg.nvars fg.nfactors] = size(G);
Daniel@0: 
Daniel@0: % default values for parameters
Daniel@0: fg.equiv_class = 1:fg.nfactors;
Daniel@0: fg.dnodes = 1:fg.nvars;
Daniel@0: 
Daniel@0: if nargin >= 4
Daniel@0:   args = varargin;
Daniel@0:   nargs = length(args);
Daniel@0:   for i=1:2:nargs
Daniel@0:     switch args{i},
Daniel@0:      case 'equiv_class', fg.equiv_class = args{i+1}; 
Daniel@0:      case 'discrete',    fg.dnodes = args{i+1}; 
Daniel@0:      otherwise,  
Daniel@0:       error(['invalid argument name ' args{i}]);       
Daniel@0:     end
Daniel@0:   end
Daniel@0: end
Daniel@0: 
Daniel@0: % so that determine_pot_type will work...
Daniel@0: fg.utility_nodes = [];
Daniel@0: %fg.decision_nodes = [];
Daniel@0: %fg.chance_nodes = fg.nvars;
Daniel@0: 
Daniel@0: fg.dom = cell(1, fg.nfactors);
Daniel@0: for f=1:fg.nfactors
Daniel@0:   fg.dom{f} = find(G(:,f));
Daniel@0: end
Daniel@0: fg.dep = cell(1, fg.nvars);
Daniel@0: for x=1:fg.nvars
Daniel@0:   fg.dep{x} = find(G(x,:));
Daniel@0: end
Daniel@0: fg.cnodes = mysetdiff(1:fg.nvars, fg.dnodes);