Analysis of a Graph:

(Or: How to know when to cut your losses)

CIS 675 Summer 2016

SableCC

• Was fun
• Not really
• I couldn't get the Analysis Adapters to work
• Understood my root node
  • But none after that
  • Spent way too much time trying to fix it

Pivot

Revelation

I can use my HW4 code.

Luthor (Lexer -> Parser -> AST)

• Already made a Graph from input
• Python
• Works (according to me)

Finding the shortest path

Analyzer

• Dijkstra's algorithm
• Finds the shortest path
• Greedy

It works!