Remove vestigial debug print statement in `walk_head_nodes` (#10718)

* `graph`: Remove vestigial debug print statement in `walk_head_nodes`

* Revert whitespace changes

* Remove more debug print statements
This commit is contained in:
Madeesh Kannan 2022-05-02 13:36:35 +02:00 committed by GitHub
parent f3de976513
commit 0a503ce5e0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 4 deletions

View File

@ -484,7 +484,6 @@ cdef class Graph:
for idx in indices: for idx in indices:
node.push_back(idx) node.push_back(idx)
i = add_node(&self.c, node) i = add_node(&self.c, node)
print("Add node", indices, i)
return Node(self, i) return Node(self, i)
def get_node(self, indices) -> Node: def get_node(self, indices) -> Node:
@ -501,7 +500,6 @@ cdef class Graph:
if node_index < 0: if node_index < 0:
return NoneNode(self) return NoneNode(self)
else: else:
print("Get node", indices, node_index)
return Node(self, node_index) return Node(self, node_index)
def has_node(self, tuple indices) -> bool: def has_node(self, tuple indices) -> bool:
@ -661,8 +659,6 @@ cdef int walk_head_nodes(vector[int]& output, const GraphC* graph, int node) nog
seen.insert(node) seen.insert(node)
i = 0 i = 0
while i < output.size(): while i < output.size():
with gil:
print("Walk up from", output[i])
if seen.find(output[i]) == seen.end(): if seen.find(output[i]) == seen.end():
seen.insert(output[i]) seen.insert(output[i])
get_head_nodes(output, graph, output[i]) get_head_nodes(output, graph, output[i])