-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraphing.py
36 lines (26 loc) · 869 Bytes
/
graphing.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
from graphviz import Digraph
from microjax import Node, trace
def draw_dot(end_node, format="svg", rankdir="LR"):
"""
format: png | svg | ...
rankdir: TB (top to bottom graph) | LR (left to right)
"""
assert rankdir in ["LR", "TB"]
nodes, edges = set(), set()
def build(v):
if v not in nodes:
nodes.add(v)
for parent in v.parents:
edges.add((parent, v))
build(parent)
build(end_node)
dot = Digraph(format=format, graph_attr={"rankdir": rankdir})
for n in nodes:
dot.node(name=str(id(n)), label=n.fun.__name__, shape="circle")
for n1, n2 in edges:
dot.edge(str(id(n1)), str(id(n2)))
return dot
def trace_and_draw(f, x):
start_node = Node.new_root()
_end_box, end_node = trace(start_node, f, x)
return draw_dot(end_node)