Posted by Laura Kruse on February 11, 2001 at 20:29:04:
In Reply to: Re: LS Algorithm - source of error (my 2 cents) posted by Laura Kruse on February 11, 2001 at 20:27:19:
Seeing as how I'm having a horrible time thinking today, let me make another comment...
If I recall correctly, I find S and R first, and then based on S and R I determine the parent's and the children in the graph...
This is a snippet of the code I have, which verifies what I'm thinking...
if you have any more comments i don't have to goto work this weekend so i can answer them...
public void build() {
//find();
find1();
System.out.println("We have found the cliques in the tree");
printCtree();
order();
System.out.println("We have eliminated duplicate cliques and ordered the cliques");
printCtree();
SR();
System.out.println("We have now located the nodes for S and R");
printCtree();
identify();
System.out.println("We have now located the parents and children for each clique");
printCtree();
compute();
System.out.println("We have now finished phi computations");
printCtree();
}
--
Laura