topsorter.py 文件源码

def findLongestPath(self, chr):
        """
        find the longest path for a chr
        :param chr: chromosome name (str)
        :return: order (list), longest_weighted_path (list)
        """
        # topological sorting and find the longest path
        dag = self.DAGs[chr]
        order = nx.topological_sort(dag)
        longest_weighted_path = self.longestWeightedPath(dag)
        # sys.stderr.write("[execute]\tPerforming topological sorting for " + str(chr) + "\n")
        # sys.stderr.write("[execute]\tFinding longest paths in " + str(chr) + "\n")
        print("[results]\tLongest weighted path in", chr, "\n", longest_weighted_path)
        return order, longest_weighted_path