@@ -258,8 +258,8 @@ def test_prioritized_topological_sort():
258258 from pytools .graph import compute_topological_order
259259 rng = random .Random (0 )
260260
261- def generate_random_graph (nnodes ):
262- graph = {i : set () for i in range (nnodes )}
261+ def generate_random_graph (nnodes : int ):
262+ graph : dict [ int , set [ int ]] = {i : set () for i in range (nnodes )}
263263 for i in range (nnodes ):
264264 # to avoid cycles only consider edges node_i->node_j where j > i.
265265 for j in range (i + 1 , nnodes ):
@@ -270,14 +270,15 @@ def generate_random_graph(nnodes):
270270
271271 nnodes = rng .randint (40 , 100 )
272272 rev_dep_graph = generate_random_graph (nnodes )
273- dep_graph = {i : set () for i in range (nnodes )}
273+ dep_graph : dict [ int , set [ int ]] = {i : set () for i in range (nnodes )}
274274
275275 for i in range (nnodes ):
276276 for rev_dep in rev_dep_graph [i ]:
277277 dep_graph [rev_dep ].add (i )
278278
279279 keys = [rng .random () for _ in range (nnodes )]
280- topo_order = compute_topological_order (rev_dep_graph , key = keys .__getitem__ )
280+ topo_order = compute_topological_order (
281+ rev_dep_graph , key = keys .__getitem__ )
281282
282283 for scheduled_node in topo_order :
283284 nodes_with_no_deps = {node for node , deps in dep_graph .items ()
@@ -303,15 +304,15 @@ def test_as_graphviz_dot():
303304 "B" : [],
304305 "C" : ["A" ]}
305306
306- from pytools .graph import NodeT , as_graphviz_dot
307+ from pytools .graph import Node , NodeT , as_graphviz_dot
307308
308309 def edge_labels (n1 : NodeT , n2 : NodeT ) -> str :
309310 if n1 == "A" and n2 == "B" :
310311 return "foo"
311312
312313 return ""
313314
314- def node_labels (node : NodeT ) -> str :
315+ def node_labels (node : Node ) -> str :
315316 if node == "A" :
316317 return "foonode"
317318
0 commit comments