def test_edges(self): """ Testing how the links are stored during traversal of the graph. """ nodes = self._create_basic_graph() # Forward traversal (check all nodes and all links) basket = Basket(nodes=[nodes['data_i'].id]) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_incoming='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=2, track_edges=True) uprule_result = uprule.run(basket.copy()) obtained = uprule_result['nodes'].keyset expected = set(anode.id for _, anode in nodes.items()) self.assertEqual(obtained, expected) obtained = set() for data in uprule_result['nodes_nodes'].keyset: obtained.add((data[0], data[1])) expected = { (nodes['data_i'].id, nodes['calc_0'].id), (nodes['data_i'].id, nodes['work_1'].id), (nodes['data_i'].id, nodes['work_2'].id), (nodes['calc_0'].id, nodes['data_o'].id), (nodes['work_1'].id, nodes['data_o'].id), (nodes['work_2'].id, nodes['data_o'].id), (nodes['work_2'].id, nodes['work_1'].id), (nodes['work_1'].id, nodes['calc_0'].id), } self.assertEqual(obtained, expected) # Backwards traversal (check partial traversal and link direction) basket = Basket(nodes=[nodes['data_o'].id]) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_outgoing='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=1, track_edges=True) uprule_result = uprule.run(basket.copy()) obtained = uprule_result['nodes'].keyset expected = set(anode.id for _, anode in nodes.items()) expected = expected.difference(set([nodes['data_i'].id])) self.assertEqual(obtained, expected) obtained = set() for data in uprule_result['nodes_nodes'].keyset: obtained.add((data[0], data[1])) expected = { (nodes['calc_0'].id, nodes['data_o'].id), (nodes['work_1'].id, nodes['data_o'].id), (nodes['work_2'].id, nodes['data_o'].id), } self.assertEqual(obtained, expected)
def test_algebra(self): """Test simple addition, in-place addition, simple subtraction, in-place subtraction""" depth0 = 4 branching0 = 2 tree0 = create_tree(max_depth=depth0, branching=branching0) basket0 = Basket(nodes=(tree0['parent'].id,)) queryb0 = orm.QueryBuilder() queryb0.append(orm.Node).append(orm.Node) rule0 = UpdateRule(queryb0, max_iterations=depth0) res0 = rule0.run(basket0.copy()) aes0 = res0.nodes depth1 = 3 branching1 = 6 tree1 = create_tree(max_depth=depth1, branching=branching1) basket1 = Basket(nodes=(tree1['parent'].id,)) queryb1 = orm.QueryBuilder() queryb1.append(orm.Node).append(orm.Node) rule1 = UpdateRule(queryb1, max_iterations=depth1) res1 = rule1.run(basket1.copy()) aes1 = res1.nodes aes2 = aes0 + aes1 union01 = aes0.keyset | aes1.keyset self.assertEqual(aes2.keyset, union01) aes0_copy = aes0.copy() aes0_copy += aes1 self.assertEqual(aes0_copy.keyset, union01) aes3 = aes0_copy - aes1 self.assertEqual(aes0.keyset, aes3.keyset) self.assertEqual(aes0, aes3) aes0_copy -= aes1 self.assertEqual(aes0.keyset, aes3.keyset, aes0_copy.keyset) self.assertEqual(aes0, aes3, aes0_copy) aes4 = aes0 - aes0 self.assertEqual(aes4.keyset, set()) aes0_copy -= aes0 self.assertEqual(aes0_copy.keyset, set())
def test_empty_input(self): """ Testing empty input. """ basket = Basket(nodes=[]) queryb = orm.QueryBuilder() queryb.append(orm.Node).append(orm.Node) uprule = UpdateRule(queryb, max_iterations=np.inf) result = uprule.run(basket.copy())['nodes'].keyset self.assertEqual(result, set())
def test_cycle(self): """ Testing the case of a cycle (workflow node with a data node that is both an input and an output): - Update rules with no max iterations should not get stuck. - Replace rules should return alternating results. """ data_node = orm.Data().store() work_node = orm.WorkflowNode() work_node.add_incoming(data_node, link_type=LinkType.INPUT_WORK, link_label='input_link') work_node.store() data_node.add_incoming(work_node, link_type=LinkType.RETURN, link_label='return_link') basket = Basket(nodes=[data_node.id]) queryb = orm.QueryBuilder() queryb.append(orm.Node).append(orm.Node) uprule = UpdateRule(queryb, max_iterations=np.inf) obtained = uprule.run(basket.copy())['nodes'].keyset expected = set([data_node.id, work_node.id]) self.assertEqual(obtained, expected) rerule1 = ReplaceRule(queryb, max_iterations=1) result1 = rerule1.run(basket.copy())['nodes'].keyset self.assertEqual(result1, set([work_node.id])) rerule2 = ReplaceRule(queryb, max_iterations=2) result2 = rerule2.run(basket.copy())['nodes'].keyset self.assertEqual(result2, set([data_node.id])) rerule3 = ReplaceRule(queryb, max_iterations=3) result3 = rerule3.run(basket.copy())['nodes'].keyset self.assertEqual(result3, set([work_node.id])) rerule4 = ReplaceRule(queryb, max_iterations=4) result4 = rerule4.run(basket.copy())['nodes'].keyset self.assertEqual(result4, set([data_node.id]))
def test_groups(self): """ Testing connection between (aiida-)groups and (aiida-)nodes, which are treated as if they both were (graph-)nodes. """ node1 = orm.Data().store() node2 = orm.Data().store() node3 = orm.Data().store() node4 = orm.Data().store() group1 = orm.Group(label='group-01').store() group1.add_nodes(node1) group2 = orm.Group(label='group-02').store() group2.add_nodes(node2) group2.add_nodes(node3) group3 = orm.Group(label='group-03').store() group3.add_nodes(node4) group4 = orm.Group(label='group-04').store() group4.add_nodes(node4) # Rule that only gets nodes connected by the same group queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Group, with_node='nodes_in_set', tag='groups_considered', filters={'type_string': 'user'}) queryb.append(orm.Data, with_group='groups_considered') initial_node = [node2.id] basket_inp = Basket(nodes=initial_node) tested_rule = UpdateRule(queryb, max_iterations=np.inf) basket_out = tested_rule.run(basket_inp.copy()) obtained = basket_out['nodes'].keyset expected = set([node2.id, node3.id]) self.assertEqual(obtained, expected) obtained = basket_out['groups'].keyset expected = set() self.assertEqual(obtained, expected) # But two rules chained should get both nodes and groups... queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Group, with_node='nodes_in_set', filters={'type_string': 'user'}) rule1 = UpdateRule(queryb) queryb = orm.QueryBuilder() queryb.append(orm.Group, tag='groups_in_set') queryb.append(orm.Node, with_group='groups_in_set') rule2 = UpdateRule(queryb) ruleseq = RuleSequence((rule1, rule2), max_iterations=np.inf) # ...both starting with a node initial_node = [node2.id] basket_inp = Basket(nodes=initial_node) basket_out = ruleseq.run(basket_inp.copy()) obtained = basket_out['nodes'].keyset expected = set([node2.id, node3.id]) self.assertEqual(obtained, expected) obtained = basket_out['groups'].keyset expected = set([group2.id]) self.assertEqual(obtained, expected) # ...and starting with a group initial_group = [group3.id] basket_inp = Basket(groups=initial_group) basket_out = ruleseq.run(basket_inp.copy()) obtained = basket_out['nodes'].keyset expected = set([node4.id]) self.assertEqual(obtained, expected) obtained = basket_out['groups'].keyset expected = set([group3.id, group4.id]) self.assertEqual(obtained, expected) # Testing a "group chain" total_groups = 10 groups = [] for idx in range(total_groups): new_group = orm.Group(label='group-{}'.format(idx)).store() groups.append(new_group) nodes = [] edges = set() for idx in range(1, total_groups): new_node = orm.Data().store() groups[idx].add_nodes(new_node) groups[idx - 1].add_nodes(new_node) nodes.append(new_node) edges.add(GroupNodeEdge(node_id=new_node.id, group_id=groups[idx].id)) edges.add(GroupNodeEdge(node_id=new_node.id, group_id=groups[idx - 1].id)) qb1 = orm.QueryBuilder() qb1.append(orm.Node, tag='nodes_in_set') qb1.append(orm.Group, with_node='nodes_in_set', filters={'type_string': 'user'}) rule1 = UpdateRule(qb1, track_edges=True) qb2 = orm.QueryBuilder() qb2.append(orm.Group, tag='groups_in_set') qb2.append(orm.Node, with_group='groups_in_set') rule2 = UpdateRule(qb2, track_edges=True) ruleseq = RuleSequence((rule1, rule2), max_iterations=np.inf) initial_node = [nodes[-1].id] basket_inp = Basket(nodes=initial_node) basket_out = ruleseq.run(basket_inp.copy()) obtained = basket_out['nodes'].keyset expected = set(n.id for n in nodes) self.assertEqual(obtained, expected) obtained = basket_out['groups'].keyset expected = set(g.id for g in groups) self.assertEqual(obtained, expected) # testing the edges between groups and nodes: result = basket_out['groups_nodes'].keyset self.assertEqual(result, edges)
def test_basic_graph(self): """ Testing basic operations for the explorer: - Selection of ascendants. - Selection of descendants. - Ascendants and descendants through specific links. - Ascendants and descendants of specific type. """ nodes = self._create_basic_graph() basket_w1 = Basket(nodes=[nodes['work_1'].id]) basket_w2 = Basket(nodes=[nodes['work_2'].id]) # Find all the descendants of work_1 queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_incoming='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['calc_0'].id, nodes['data_o'].id)) self.assertEqual(obtained, expected) # Find all the descendants of work_1 through call_calc (calc_0) edge_cacalc = {'type': {'in': [LinkType.CALL_CALC.value]}} queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_incoming='nodes_in_set', edge_filters=edge_cacalc) uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['calc_0'].id)) self.assertEqual(obtained, expected) # Find all the descendants of work_1 that are data nodes (data_o) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Data, with_incoming='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['data_o'].id)) self.assertEqual(obtained, expected) # Find all the ascendants of work_1 queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_outgoing='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['work_2'].id, nodes['data_i'].id)) self.assertEqual(obtained, expected) # Find all the ascendants of work_1 through input_work (data_i) edge_inpwork = {'type': {'in': [LinkType.INPUT_WORK.value]}} queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_outgoing='nodes_in_set', edge_filters=edge_inpwork) uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['data_i'].id)) self.assertEqual(obtained, expected) # Find all the ascendants of work_1 that are workflow nodes (work_2) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.ProcessNode, with_outgoing='nodes_in_set') uprule = UpdateRule(queryb, max_iterations=10) obtained = uprule.run(basket_w1.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['work_2'].id)) self.assertEqual(obtained, expected) # Only get the descendants that are direct (1st level) (work_1, data_o) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_incoming='nodes_in_set') rerule = ReplaceRule(queryb, max_iterations=1) obtained = rerule.run(basket_w2.copy())['nodes'].keyset expected = set((nodes['work_1'].id, nodes['data_o'].id)) self.assertEqual(obtained, expected) # Only get the descendants of the descendants (2nd level) (calc_0, data_o) queryb = orm.QueryBuilder() queryb.append(orm.Node, tag='nodes_in_set') queryb.append(orm.Node, with_incoming='nodes_in_set') rerule = ReplaceRule(queryb, max_iterations=2) obtained = rerule.run(basket_w2.copy())['nodes'].keyset expected = set((nodes['calc_0'].id, nodes['data_o'].id)) self.assertEqual(obtained, expected)