Use petgraph to represent dependency graph

[ethowitz]

We really ought to represent the "IR" dependency graph as petgraph's StableDiGraph. That would give us a bunch of goodies for free, including:

• Traversal algorithms
• The ability to store dependency info directly on edges (e.g. whether a dependency is optional)
• The ability to output the graph in dot format, which would make debugging easier