35.2 - Junction tree algorithm

[@jianliu5258]

In 18:28, should we connet IGS and HGJ ?

[@martinoka]

Yes, I am pretty sure we are supposed to

[@MaxLibbrecht]

Yes, this is correct, thanks for pointing it out.

[@user-ej6fz2lt3u]

What about DIG and HGJ ? (I thought you just connect any that share common vertex.. before then removing them if not part of a maxST.. or am I wrong?)

[@阿夏-y7k]

This video helps me a lot!!! Thank you !!!

[@DgibrillyMutabazi]

This really helped ! Keep posting❤‍🔥

[@marianahidalgosandoval2184]

Gracias!

[@temmytory4309]

the graph at 16:44 is not the same as the one in 16:39, there is a new edge (G,S) that has now been added. I thought that the edge (G,S) should not have been added until as a fill in edge after introducing the node IGS?

[@MaxLibbrecht]

Thanks for noticing this. I think you're right. This figure is from the Murphy textbook; it may be able to answer your question. When I revise this lecture for next year's class, I will double-check this.