A method for identifying a route within a parking area having a plurality of parking spaces for a vehicle, comprising: establishing a plurality of nodes on a topographic map, wherein the nodes are located along a plurality of paths extending between and adjacent to the parking spaces, and wherein each of the nodes has latitude and longitudinal coordinates; establishing a plurality of links on the topographic map, wherein the links each extend between two of the nodes, and wherein at least one of the links extends along at least one of the plurality of parking spaces; establishing a first node of the plurality of nodes as a starting node at which the vehicle starts and establishing a second node of the plurality nodes as a target node; and establishing a route from the starting node to the target node that follows a series of at least a portion of the plurality of links to the target node using Dijkstra's algorithm; characterised in that a cost associated with each link for purposes of establishing the route with Dijkstra's algorithm is based on the equation: Cost = Adjacency + ƒ LinkLength ParkingSpaces wherein any of the links that are associated with a non-zero number of parking spaces are non-zero links, and wherein the Adjacency of the non-zero links is zero; wherein any of the links that are associated with zero parking spaces are zero links, and wherein the Adjacency of the zero links is based on a number of zero links between the subject zero link and the closest non-zero link; wherein f ( LinkLength, ParkingSpaces) for zero links is a predetermined constant; and wherein f ( LinkLength, ParkingSpaces) for non-zero links is equal to the link length divided by the number of parking spaces that border the link. establishing a plurality of nodes on a topographic map, wherein the nodes are located along a plurality of paths extending between and adjacent to the parking spaces, and wherein each of the nodes has latitude and longitudinal coordinates; establishing a plurality of links on the topographic map, wherein the links each extend between two of the nodes, and wherein at least one of the links extends along at least one of the plurality of parking spaces; establishing a first node of the plurality of nodes as a starting node at which the vehicle starts and establishing a second node of the plurality nodes as a target node; and establishing a route from the starting node to the target node that follows a series of at least a portion of the plurality of links to the target node using Dijkstra's algorithm; characterised in that a cost associated with each link for purposes of establishing the route with Dijkstra's algorithm is based on the equation: Cost = Adjacency + ƒ LinkLength ParkingSpaces wherein any of the links that are associated with a non-zero number of parking spaces are non-zero links, and wherein the Adjacency of the non-zero links is zero; wherein any of the links that are associated with zero parking spaces are zero links, and wherein the Adjacency of the zero links is based on a number of zero links between the subject zero link and the closest non-zero link; wherein f ( LinkLength, ParkingSpaces) for zero links is a predetermined constant; and wherein f ( LinkLength, ParkingSpaces) for non-zero links is equal to the link length divided by the number of parking spaces that border the link.