Serial ordering of software objects with cyclic dependencies

One or more non-transitory computer-readable media storing instructions which, when executed by one or more hardware processors, cause the hardware processors to perform operations comprising:

• for a graph of nodes and directed edges respectively representing a plurality of software objects and pairwise dependencies therebetween, the directed edges collectively further representing cyclic dependencies among the software objects, generating a condensation of the graph having a topological order;
• wherein the condensation comprises a contracted node representing a strongly connected component of the graph;
• wherein the strongly connected component comprises a plurality of the nodes having, for each pair of distinct first and second nodes among the plurality of nodes, a first path leading from the first node to the second node and a second path leading from the second node to the first node, the first and second paths being along respective edges among the directed edges;
• wherein the contracted node represents the plurality of nodes of the strongly connected component and further represents corresponding objects among the software objects;
• and
• loading the software objects onto a target serially, according to the topological order.

A system comprising:

• one or more hardware processors with memory coupled thereto;
• and
• computer-readable storage media storing instructions which, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:
• receiving a request to load a plurality of software objects having one or more cyclic dependencies;
• building a first graph comprising first nodes and directed edges, wherein the first nodes represent respective objects of the software objects, and wherein each edge of the directed edges joins a respective pair of the nodes and represents a dependency between the respective objects represented by the pair of the nodes;
• identifying one or more strongly connected components of the first graph comprising one or more disjoint respective subsets of the nodes and representing one or more corresponding subsets of the software objects;
• forming a directed acyclic second graph as a condensation of the first graph, the second graph comprising one or more second nodes, each second node of the one or more second nodes representing the corresponding subset of the software objects for a respective component of the one or more strongly connected components;
• determining a topological ordering of the second graph;
• generating a serial loading manifest of the software objects according to the topological ordering of the second graph, wherein the generating comprises:
• for any of the first nodes present in the second graph, placing an entry for the respective object in the serial loading manifest;
• and
• for each second node of the one or more second nodes:
• expanding the each second node into a serial list of the corresponding subset of the software objects;
• and
• placing the serial list in contiguous locations within the serial loading manifest;
• transmitting the serial loading manifest to a target;
• and
• loading the plurality of software objects serially as ordered in the serial loading manifest, wherein the loading operation is controlled, using the serial loading manifest, by the target.