Expand description
Implements Dijkstra’s algorithm for shortest path, to find an optimal and readable diff between two ASTs.
Structs
Functions
What is the total number of AST nodes?
Return the shortest route from the
start
to the end vertex.Return the shortest route from
start
to the end vertex.How many top-level AST nodes do we have?