Giovanni Pace
I'll explain how to correctly define input size for a graph algorithm and how to calculate O(n) complexity. Understanding this is fundamental to reasoning about performance precisely, rather than by intuition.