•Redraw any undirected graph into a clique graph
–Initialize one separator potential as Z and all others as 1
–For directed graphs, use moralization to transform into anundirected graph
•If the clique graph is a tree, use breadth-firstadsorption from leaves to root and back down.
•Got marginals for all clique and separator nodes
•What if it is not a tree?