def find_longest_path(sgraph): kmax = 1 for t in sgraph.itertransfrags(): path_length = sum(1 for n in split_transfrag(t, sgraph.node_bounds)) kmax = max(kmax, path_length) return kmax
def get_node_lengths(sgraph, t): return [(n[1] - n[0]) for n in split_transfrag(t, sgraph.node_bounds)]
def get_node_lengths(sgraph, t): return [(n[1]-n[0]) for n in split_transfrag(t, sgraph.node_bounds)]