1. A method, comprising: executing, by a processor, an algorithm that discovers failed network fragments in a network, each one of the failed network fragments having no connectivity path to any other failed network fragment; determining, by the processor, a shortest path between nodes in the network; assigning, by the processor, an infinite length between two nodes in different ones of the failed network fragments; applying, by the processor, a graphing algorithm, after discovery, to each one of the failed network fragments discovered by the algorithm; generating, by the processor, a result of the graphing algorithm for each one of the failed network fragments; combining, by the processor, results of the graphing algorithm for all the failed network fragments; and assigning, by the processor, a combined result to the network.