def test_remove_undirected_edge_when_not_exist(): graph = MarkedPatternGraph(nodes=['a', 'b']) graph.remove_undirected_edge(('a', 'b')) assert set(graph.get_undirected_edges()) == set({}) assert set(graph.get_unmarked_arrows()) == set({}) assert set(graph.get_marked_arrows()) == set({}) assert set(graph.get_bidirectional_edges()) == set({}) assert set(graph.get_edges()) == set({})
def test_bidirectional_edges(): graph = MarkedPatternGraph(nodes=['a', 'b']) graph.add_undirected_edge(('a', 'b')) graph.add_arrowhead(('a', 'b')) graph.add_arrowhead(('b', 'a')) assert set(graph.get_undirected_edges()) == set({}) assert set(graph.get_unmarked_arrows()) == set({}) assert set(graph.get_marked_arrows()) == set({}) assert set(graph.get_bidirectional_edges()) == set({frozenset({'a', 'b'})})
def test_add_undirected_edge_instantiate(): graph = MarkedPatternGraph(nodes=['a', 'b'], undirected_edges=[('a', 'b')]) assert graph.get_undirected_edges() == set({frozenset({'a', 'b'})})
def test_add_undirected_edge(): graph = MarkedPatternGraph(nodes=['a', 'b']) graph.add_undirected_edge(('a', 'b')) assert graph.get_undirected_edges() == set({frozenset({'a', 'b'})})