In this paper we have considered the problem of approximating an underlying distribution by one derived from a dependence polytree. This paper proposes a formal and systematic algorithm, which traverses the undirected tree obtained by the Chow method [2], and by using the independence tests it successfully orients the polytree. Our algorithm uses an application of the Depth First Search (DFS) strategy to multiple causal basins. The algorithm has been formally proven and rigorously tested for synthetic and real-life data.