Method fringe

pattern/graph/__init__.py:491–496

For depth=0, returns the list of leaf nodes (nodes with only one connection). For depth=1, returns the list of leaf nodes and their connected nodes, and so on.

(self, depth=0, traversable=lambda node, edge: True)

            self.remove(n)
            
    def fringe(self, depth=0, traversable=lambda node, edge: True):
        """ For depth=0, returns the list of leaf nodes (nodes with only one connection).
            For depth=1, returns the list of leaf nodes and their connected nodes, and so on.
        """
        u = []; [u.extend(n.flatten(depth, traversable)) for n in self.nodes if len(n.links) == 1]
        return unique(u)
        
    @property
    def density(self):