def generate_nodes_without_groups_and_no_outgoing_edges()

in visualize_rules_graph.py [0:0]

• 5 lines of code
• 4 McCabe index (conditional complexity)

def generate_nodes_without_groups_and_no_outgoing_edges():
    # nodes that don't have any group, not even 'Cleanup_Rule'
    # and also no outgoing edge
    # i.e., leaf nodes with no groups -> standalone shape
    for node in nodes_without_groups:
        # avoid adding a node already added through an edge
        if node not in added_nodes:
            added_nodes.add(node)
            graph.node(node)