The scaling and other quantifiable properties of a network have recently been proven valuable
in understanding the robustness and vulnerability properties of various societal and infrastructural
networks. In this paper we revisit the algorithms for computing various quantifiable
properties of a planar road network and consider the algorithmic complexity and scalability in
the light of recent technological advances. We compute properties for a sample of interesting
trunk road networks and discuss their applicability in determining the relative importance or
criticality to the whole network of a particular node. We discuss the implications of present
and anticipated technological capabilities in calculating properties for anticipated network
sizes in the light of 64-bit computer architectures and commodity parallel computing.
