recompute redoes all the graph algorithms each time the graph is updated.

remove destructively removes all occurrences of x from slice, sorts it, and returns it.

Dominator tree construction This file was plundered from golang.org/x/tools/go/ssa/dom.go and modified to support a different graph representation, m

eval implements the EVAL part of the LT algorithm.

id returns the entry's DOM element ID in the jsTree.

link implements the LINK part of the LT algorithm.

buildDomTree computes the dominator tree of f using the LT algorithm. The first node is the distinguished root node.

dfs implements the depth-first search part of the LT algorithm.

getDirent returns the dirent for a given slash-separated path. TODO explain module behavior.

numberDomTree sets the pre- and post-order numbers of a depth-first traversal of the dominator tree rooted at v. These are used to answer dominance q

Dominates reports whether b dominates c.

Dominees returns the list of blocks that b immediately dominates: its children in the dominator tree.

TODO: - select the initial nodes initially in the dir tree. - need more rigor with IDs. Test on a project with multiple versioned modules. - support g

onBreak handles the /break (from, to int, all bool) endpoint.

onData handles the /data endpoint. It emits all the server's state as JSON: the list of root packages, the directory tree of packages in jsTree form,

onUnbreak handles the /unbreak (from, to int) endpoint.