Lines Matching +full:- +full:- +full:add

1 # Copyright 2009-2013, 2019 Peter A. Bigot
3 # SPDX-License-Identifier: Apache-2.0
31         Add a node without any target to the graph.
33         self.__nodes.add(node)
37         Add a directed edge from the C{source} to the C{target}.
41         self.__edge_map[source].add(target)
43             self.__reverse_map[target].add(source)
44         self.__nodes.add(source)
45         self.__nodes.add(target)
60                     self.__roots.add(n)
68         # computes the strongly-connected components
122                 if v == scc[-1]:
127         """Return the strongly-connected components in order.
133         This order is preferred over a depth-first-search order for
165         unit_addr = -1