1 # Copyright 2018 ZTE Corporation.
3 # Licensed under the Apache License, Version 2.0 (the "License");
4 # you may not use this file except in compliance with the License.
5 # You may obtain a copy of the License at
7 # http://www.apache.org/licenses/LICENSE-2.0
9 # Unless required by applicable law or agreed to in writing, software
10 # distributed under the License is distributed on an "AS IS" BASIS,
11 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 # See the License for the specific language governing permissions and
13 # limitations under the License.
16 from collections import deque
17 from collections import OrderedDict
19 logger = logging.getLogger(__name__)
24 def __init__(self, graph_dict=None):
25 self.graph = OrderedDict()
27 for node, dep_nodes in list(graph_dict.items()):
28 self.add_node(node, dep_nodes)
30 def add_node(self, node, dep_nodes):
31 if node not in self.graph:
32 self.graph[node] = set()
33 if isinstance(dep_nodes, list):
34 for dep_node in dep_nodes:
35 if dep_node not in self.graph:
36 self.graph[dep_node] = set()
37 if dep_node not in self.graph[node]:
38 self.graph[node].add(dep_node)
40 def get_pre_nodes(self, node):
41 return [k for k in self.graph if node in self.graph[k]]
45 for node in self.graph:
47 for node in self.graph:
48 for dependent in self.graph[node]:
49 degree[dependent] += 1
53 queue.appendleft(node)
57 sort_list.append(node)
58 for dependent in self.graph[node]:
59 degree[dependent] -= 1
60 if degree[dependent] == 0:
61 queue.appendleft(dependent)
62 if len(sort_list) == len(self.graph):
69 for node, dependents in list(self.graph.items()):
71 for dep in dependents:
72 dict[node].append(dep)