INNER CODE UNIT · Python

iter_graph

steineggerlab/Metabuli · util/gtdb_to_taxdump.py:130

    def iter_graph(self, vertex):
        """ General iteration of all nodes in the graph """
        if vertex == 'root':
            self.__seen = {}
        for child in self.__graph_dict[vertex]:
            if child not in self.__seen:
                print('Parent: {}; Child: {}'.format(vertex, child))
                self.iter_graph(child)
                self.__seen[child] = 1
    
    def _write_dmp_iter(self, vertex, names, nodes, embl_code='XX'):
        for child in self.__graph_dict[vertex]:
            if child in self.__seen:
                continue
            self.__seen[child] = 1
            # names
            names.append([str(self.__graph_nodeIDs[child]), child, '',
                          'scientific name'])

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…