Method MergeGraph

src/Sysdig/real-time/ProvGraph.py:608–668

(self,graph_cache,graph_list)

        return result
    
    def MergeGraph(self,graph_cache,graph_list):
        connection_map = np.zeros((len(graph_cache), len(graph_list)), dtype=int)
        for i,g1 in enumerate(graph_cache):
            g1 = g1.graph
            for k,g2 in enumerate(graph_list):
                node_l1 = set(g1.nodes())
                node_l2 = set(g2.nodes())
                common_node = node_l1 & node_l2
                if len(common_node) > 0:
                    connection_map[i][k] = 1

        merged_graph_list = []
        for x in range(connection_map.shape[0]):
            row = connection_map[x]
            if np.all(row == 0):
                merged_graph_list.append(graph_cache[x])
                graph_cache[x].timestamp += 1

        for y in range(connection_map.shape[1]):
            col = connection_map[:,y]
            if np.all(col == 0):
                # g = self.graph_taylor(graph_list[y])
                # g.graph['score'] = np.sum([self.GetNodeScore(node) for node in g.nodes])
                cache_graph = CacheGraph(graph_list[y])
                merged_graph_list.append(cache_graph)
         
        Merged_graph = []
        while not np.all(connection_map == 0):
            start_x, start_y = 0, 0
            find = False
            for i in range(connection_map.shape[0]):
                for j in range(connection_map.shape[1]):
                    if connection_map[i][j] == 1:
                        start_x = i
                        start_y = j
                        find = True
                        break
                if find:
                    break
            
            r = self.GetSubset(connection_map,start_x,start_y)
            r.append(start_x)
            r.append(start_y + connection_map.shape[0])
            Merged_graph.append(r)

        for l in Merged_graph:
            tmp_graph_list = []
            for idx in l:
                if idx >= connection_map.shape[0]:
                    tmp_graph_list.append(graph_list[idx - connection_map.shape[0]])
                else:
                    tmp_graph_list.append(graph_cache[idx].graph)
            G = nx.compose_all(tmp_graph_list)

            G = self.graph_taylor(G)

            # assert(nx.is_weakly_connected(G))
            G.graph['score'] = np.sum([self.nodes[node]['score'] for node in G.nodes])