[Chapter 10: Efficient algorithms] A sentence of clarification

[MKJM2]

In the 'Finding the shorest path in a graph' section (12.1.1) of chapter 10 (Efficient algorithms), we have that using a queue gives us an O(m) way of finding the shortest path, but m doesn't get defined until next page. We could explain that m refers to the number of edges, so that the reader doesn't get confused.