We consider acyclic two-rooted directed graph for which the length of all directed paths from 0 to r has the same path length. Using the interface matrix, we calculate the resistance of such graph and give a mathematical formulation of the formula which compute the resistance exactly in rational numbers. KEYWORDS: acyclic directed Graph, interface matrix, nodal graph, non-nodal graph