-
Notifications
You must be signed in to change notification settings - Fork 17
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
8 changed files
with
108 additions
and
52 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
from display import Display | ||
from .display import Display | ||
|
||
|
||
def plot_(output, *args): | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,90 @@ | ||
import unittest | ||
import logging | ||
|
||
from bamt.utils import GraphUtils | ||
from bamt.networks.discrete_bn import DiscreteBN | ||
from bamt.nodes.discrete_node import DiscreteNode | ||
from bamt.builders.builders_base import VerticesDefiner | ||
from bamt.display import plot_ | ||
|
||
logging.getLogger("builder").setLevel(logging.CRITICAL) | ||
|
||
|
||
class TestGraphAnalyzer(unittest.TestCase): | ||
def setUp(self): | ||
self.bn = DiscreteBN() | ||
definer = VerticesDefiner(descriptor={"types": { | ||
"Node0": "disc", | ||
"Node1": "disc", | ||
"Node2": "disc", | ||
"Node3": "disc_num", | ||
"Node4": "disc", | ||
"Node5": "disc", | ||
"Node6": "disc", | ||
"Node7": "disc", | ||
"Node8": "disc", | ||
"Node9": "disc", | ||
}, | ||
"signs": {}, | ||
}, | ||
regressor=None) | ||
|
||
definer.skeleton["V"] = [ | ||
DiscreteNode(name=f"Node{i}") for i in range(10) | ||
] | ||
definer.skeleton["E"] = [ | ||
("Node0", "Node1"), | ||
("Node0", "Node2"), | ||
("Node2", "Node3"), | ||
("Node4", "Node7"), | ||
("Node1", "Node5"), | ||
("Node5", "Node6"), | ||
("Node7", "Node0"), | ||
("Node8", "Node1"), | ||
("Node9", "Node2"), | ||
] | ||
definer.get_family() | ||
|
||
self.bn.nodes = definer.skeleton["V"] | ||
self.bn.edges = definer.skeleton["E"] | ||
|
||
self.analyzer = GraphUtils.GraphAnalyzer(self.bn) | ||
|
||
def test_markov_blanket(self): | ||
result = self.analyzer.markov_blanket("Node0") | ||
result["nodes"] = sorted(result["nodes"]) | ||
self.assertEqual( | ||
{'edges': [('Node0', 'Node1'), | ||
('Node0', 'Node2'), | ||
('Node7', 'Node0'), | ||
('Node8', 'Node1'), | ||
('Node9', 'Node2')], | ||
'nodes': sorted(['Node0', 'Node1', 'Node2', 'Node7', 'Node8', 'Node9'])} | ||
, | ||
result | ||
) | ||
|
||
def test_find_family(self): | ||
without_parents = self.analyzer.find_family("Node0", 0, 2, None) | ||
without_parents["nodes"] = sorted(without_parents["nodes"]) | ||
self.assertEqual( | ||
{'nodes': sorted(['Node3', 'Node2', 'Node1', 'Node0', 'Node5']), | ||
'edges': [('Node0', 'Node1'), ('Node0', 'Node2'), ('Node2', 'Node3'), ('Node1', 'Node5')]}, | ||
without_parents | ||
) | ||
|
||
without_children = self.analyzer.find_family("Node0", 2, 0, None) | ||
without_children["nodes"] = sorted(without_children["nodes"]) | ||
self.assertEqual( | ||
{'nodes': sorted(['Node4', 'Node7', 'Node0']), | ||
'edges': [('Node4', 'Node7'), ('Node7', 'Node0')]}, | ||
without_children | ||
) | ||
|
||
plot_("here.html", | ||
[self.bn[node] for node in without_children["nodes"]], | ||
without_children["edges"]) | ||
|
||
|
||
if __name__ == "__main__": | ||
unittest.main(verbosity=2) |