add_link(node_list, link_list, u, 0, u.variable, 0)
if hasattr(u, 'next_functions'):
- i = 0
- for v, j in u.next_functions:
+ for i, (v, j) in enumerate(u.next_functions):
fill_graph_lists(v, node_labels, node_list, link_list)
add_link(node_list, link_list, u, i, v, j)
- i += 1
######################################################################
def print_dot(node_list, link_list, out):
out.write('digraph{\n')
- out.write(' graph [fontname = "helvetica"];\n')
- out.write(' node [fontname = "helvetica"];\n')
- out.write(' edge [fontname = "helvetica"];\n')
-
for n in node_list:
node = node_list[n]