def main():
a = BayesNode(0, name="a")
b = BayesNode(1, name="b")
c = BayesNode(2, name="c")
a.add_neighbor(b)
a.add_neighbor(c)
assert Star.get_missing_edges_of_node(a) == [{b, c}]
By an edge we mean a set of two nodes.
Parameters
----------
nd : BayesNode
Returns
-------
list[set[BayesNode]]
"""
edges = list()
neig_list = list(nd.neighbors)
for k in range(len(neig_list)):
n1 = neig_list[k]
for n2 in neig_list[k+1:]:
if not n2.has_neighbor(n1):
edges.append({n1, n2})
return edges
from nodes.Node import *
if __name__ == "__main__":
a = BayesNode(0, name="a")
b = BayesNode(1, name="b")
c = BayesNode(2, name="c")
a.add_neighbor(b)
a.add_neighbor(c)
assert(Star.get_missing_edges_of_node(a) == [{b, c}])
Parameters
----------
nd : BayesNode
Returns
-------
list[set[BayesNode]]
"""
edges = list()
neig_list = list(nd.neighbors)
for k in range(len(neig_list)):
n1 = neig_list[k]
for n2 in neig_list[k + 1:]:
if not n2.has_neighbor(n1):
edges.append({n1, n2})
return edges
from nodes.Node import *
if __name__ == "__main__":
a = BayesNode(0, name="a")
b = BayesNode(1, name="b")
c = BayesNode(2, name="c")
a.add_neighbor(b)
a.add_neighbor(c)
assert (Star.get_missing_edges_of_node(a) == [{b, c}])
