| CPC H04L 41/145 (2013.01) [H04L 41/12 (2013.01); H04L 41/16 (2013.01)] | 20 Claims |

|
1. A method comprising:
obtaining information describing a plurality of network implementations, the information including a heterogeneous plurality of nodes;
generating a one-hop graph connecting a particular node of the heterogeneous plurality of nodes with a set of related nodes of the heterogeneous plurality of nodes, the one-hop graph connecting the particular node with the set of related nodes via corresponding edges; and
transforming the one-hop graph into a weighted graph based on a Dynamic Meta Path Transformation (DMPT), wherein each of the corresponding edges connecting the particular node to a corresponding related node among the set of related nodes is associated with a corresponding weight.
|