Lines Matching +full:- +full:- +full:graph

1 # Copyright 2009-2013, 2019 Peter A. Bigot
3 # SPDX-License-Identifier: Apache-2.0
11 class Graph:  class
13     Represent a directed graph with edtlib Node objects as nodes.
31         Add a node without any target to the graph.
39         The nodes are added to the graph if necessary.
64         # Execute Tarjan's algorithm on the graph.
68         # computes the strongly-connected components
70         # of the graph: i.e., the sets of nodes that form a minimal
85 …         raise Exception('TARJAN: No roots found in graph with {} nodes'.format(len(self.__nodes)))
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