digging the code?

[Yang Y]

I'm new to map applications devel, and am interested in studying the
routing algorithms.

I downloaded the andNav source. could someone give me a few pointers
as to how to start
browsing the code base? I'm interested in how the code calculates the
route , for example, is there
some method that calculates the Djikstra shortest path between A and
B ?

thanks
Yang