def test_rank(): dotter = Dotter() for node in ['a', 'b', 'c', 'd']: dotter.add_node(node, label=node) dotter.add_edge('a', 'b') dotter.add_edge('a', 'c') dotter.add_edge('a', 'd') dotter.rank(['a', 'b'], RankType.Min) dotter.rank(['c'], RankType.Same) dotter.rank(['d'], RankType.Max) expected = load_data('test_rank.dot') assert expected == dotter.commands
def test_strict(): dotter = Dotter(strict=False) dotter.add_edge('a', 'b') dotter.add_edge('a', 'b') expected = ['digraph', ' {', 'gb -> gc', 'gb -> gc'] assert expected == dotter.commands
def test_directed_graph(): dotter = Dotter(directed=True) dotter.add_edge('a', 'b') expected = ['digraph', ' {', 'gb -> gc'] assert expected == dotter.commands
def test_undirected_graph(): dotter = Dotter(directed=False) dotter.add_edge('a', 'b') expected = ['graph', ' {', 'gb -- gc'] assert expected == dotter.commands
def test_edge_label(): dotter = Dotter(directed=False) dotter.add_edge('a', 'b', 'a to b') expected = ['graph', ' {', 'gb -- gc [label="a to b"]'] assert dotter.commands == expected
def test_edge_attributes(): dotter = Dotter(directed=False) dotter.add_edge('a', 'b', label='a to b', direction=Directions.Both) expected = ['graph', ' {', 'gb -- gc [label="a to b", dir="both"]'] assert dotter.commands == expected