dependencygraph.py 文件源码

def nx_graph(self):
        """Convert the data in a ``nodelist`` into a networkx labeled directed graph."""
        import networkx as NX

        nx_nodelist = list(range(1, len(self.nodes)))
        nx_edgelist = [
            (n, self._hd(n))
            for n in nx_nodelist if self._hd(n)
        ]
        nx_labels = {}
        for n in nx_nodelist:
            nx_labels[n] = self.nodes[n]['word']

        g = NX.DiGraph()
        g.add_nodes_from(nx_nodelist)
        g.add_edges_from(nx_edgelist)

        return g, nx_labels