Method and apparatus for aligning an infrastructure to a template

An apparatus for determining a target infrastructure aligned with a template, the apparatus comprising:

• a memory;
• and
• a processor coupled to the memory and operative to perform the operations of:
• representing a current infrastructure as a graph having a plurality of vertices representing elements of the current infrastructure and at least one edge representing at least one dependency between the elements of the current infrastructure, wherein a given element within a set of possible elements for the infrastructure has a set of possible equivalent elements for the given element;
• finding at least one cut vertex in the graph representing the current configuration of the infrastructure, wherein removal of the cut vertex will split the graph into two sub-graphs as close in size as possible;
• and
• for each element within the set of possible equivalent elements for the cut vertex:
• replacing the cut vertex with a given element within the set of possible equivalent elements for the cut vertex;
• splitting the graph into the two sub-graphs, wherein each sub-graph includes a copy of the replaced cut vertex and edges between the replaced cut vertex and other vertices of the sub-graph;
• recursively determining whether both sub-graphs contain at least one cut vertex wherein removal of the cut vertex will split the sub-graph into two sub-graphs as close in size as possible;
• and
• responsive to a determination that both sub-graphs contain at least one cut vertex wherein removal of the cut vertex will split the sub-graph into two sub-graphs as close in size as possible, rejoining both sub-graphs so as to form a graph representing the target infrastructure, the graph having a plurality of vertices representing elements of the target infrastructure and at least one edge representing at least one dependency between the elements of the target infrastructure.

An article of manufacture for determining a target infrastructure aligned with a template, the article comprising a storage medium encoded with one or more software programs that, when executed by a processor, perform the steps of:

• representing a current infrastructure as a graph having a plurality of vertices representing elements of the current infrastructure and at least one edge representing at least one dependency between the elements of the current infrastructure, wherein a given element within a set of possible elements for the current infrastructure has a set of possible equivalent elements for the given element;
• finding at least one cut vertex in the graph representing the current configuration of the infrastructure, wherein removal of the cut vertex will split the graph into two sub-graphs as close in size as possible;
• and
• for each element within the set of possible equivalent elements for the cut vertex:
• replacing the cut vertex with a given element within the set of possible equivalent elements for the cut vertex;
• splitting the graph into the two sub-graphs, wherein each sub-graph includes a copy of the replaced cut vertex and edges between the replaced cut vertex and other vertices of the sub-graph;
• recursively determining whether both sub-graphs contain at least one cut vertex wherein removal of the cut vertex will split the sub-graph into two sub-graphs as close in size as possible;
• and
• responsive to a determination that both sub-graphs contain at least one cut vertex wherein removal of the cut vertex will split the sub-graph into two sub-graphs as close in size as possible, rejoining both sub-graphs so as to form a graph representing the target infrastructure, the graph having a plurality of vertices representing elements of the target infrastructure and at least one edge representing at least one dependency between the elements of the target infrastructure.