Disjoint path computation for arbitrary directed graph

Systems and methods for accessing network configuration data identifying one or more working path(s) configured to transport data between source and destination nodes, wherein multiple working paths are prioritized, and including at least one first diversity weight of a first value indicative of at least one communication link in the working path(s), and at least one second diversity weight of a second value indicative of at least one communication link outside of the working path(s); calculating a disjoint protection path with the network configuration data, the first diversity weight, and the second diversity weight; the disjoint protection path including at least the source node and the destination node and at least one communication link that is mutually exclusive from the at least one communication link of the first set; and outputting at least one setup signal to configure the disjoint protection path within the mesh network.