Mode analysis of logic programs is a fundnmental tool for increasing the efficiency of compiled code. Data flow analysis and abstract interpretation have been the traditional mode analysis techniques, but Ueda and Morita recently introduced an innovative method based on paths. Intuitively, moding the paths of a program involves statically finding all subterms that are of interest during execution and determining the modes of these subterms. This paper describes the first implementation of an algorithm for automatic mode analysis based on paths, along with empirical measurements of its practicality. Our implementation differs significantly from the graph propagation method originally suggested, and we show that our complexity is potentially quite low, making the method practical.