def list_auto_order(self):
        graph, broken_edges = self._break_cycles(self.list_order(),
                                                 self._get_sys_graph())
        order = nx.topological_sort(graph)
        sz = len(self.pathname)+1 if self.pathname else 0
        return [n[sz:] for n in order], broken_edges
This routine forms the unitary matrix Q described in hessenberg_reduce_0.
dataset/ETHPy150Open OpenMDAO/OpenMDAO/openmdao/core/group.py/Group.list_auto_order--crossover with--dataset/ETHPy150Open fredrik-johansson/mpmath/mpmath/matrices/eigen.py/hessenberg_reduce_1