1. A method for deploying maximally redundant trees implemented in a network element implementing functionalities of a path computation element (PCE) of a network, wherein the network contains a plurality of network elements, the method comprising: computing, by the network element, a generalized almost directed acyclic graph (GADAG) for the network, wherein the GADAG is a graph abstraction of the network, wherein the plurality of network elements are vertices of the GADAG and links connecting the plurality of network elements are directed edges of the GADAG; assembling, by the network element, a GADAG descriptor describing the computed GADAG; and distributing, by the network element, the GADAG descriptor to the plurality of network elements, wherein each of the plurality of network elements utilizes the GADAG descriptor to compute maximally redundant trees (MRTs) for forwarding traffic.