Optimization when computing a message to a factor from a variable when the variable has no other neighbors

[GoogleCodeExporter]

A possible optimization opportunity is when computing a message to a factor 
from a variable when the variable has no other neighbors should be fast (since 
the neighbors set minus the requesting factor is the empty set) should be 
pretty fast, since it's trivial, but it takes around 58ms. Seems like a good 
opportunity for optimization? We can find which step is taking long and test 
for the trivial inputs (probably the empty set) and implement a shortcut.

Original issue reported on code.google.com by [email protected] on 15 May 2013 at 4:46

[GoogleCodeExporter]

Original comment by [email protected] on 16 May 2013 at 8:26

• Added labels: Milestone-Unscheduled