Searched refs:DirectedGraph (Results 1 – 3 of 3) sorted by relevance
| /petsc/config/BuildSystem/ |
| H A D | graph.py | 5 class DirectedGraph(object): class
96 for vertex in DirectedGraph.breadthFirstSearch(self):
103 leaves = DirectedGraph.getLeaves(self)
105 map(lambda v: self.addEdges(v, outputs = DirectedGraph.getRoots(graph)), leaves)
110 roots = DirectedGraph.getRoots(self)
112 map(lambda v: self.addEdges(v, outputs = roots), DirectedGraph.getLeaves(graph))
138 for v2 in DirectedGraph.depthFirstVisit(graph, v, seen, returnFinished, outEdges):
156 for v in DirectedGraph.depthFirstVisit(graph, vertex, seen, returnFinished, outEdges):
167 queue = DirectedGraph.getRoots(graph)[0:1]
190 …vertices = [vertex for vertex in DirectedGraph.depthFirstSearch(graph, returnFinished = 1, outEdge…
[all …]
|
| /petsc/config/BuildSystem/config/ |
| H A D | framework.py | 71 self.childGraph = graph.DirectedGraph()
1222 for child in graph.DirectedGraph.getRoots(depGraph):
1372 ndepGraph = list(graph.DirectedGraph.topologicalSort(depGraph))
1427 depGraph = graph.DirectedGraph.topologicalSort(depGraph)
|
| H A D | package.py | 994 depGraph = graph.DirectedGraph()
1012 return [sortnode for sortnode in graph.DirectedGraph.topologicalSort(depGraph,start=startnode)]
|