Merge pull request #1 from cserret/patch-1

Update README.md

Author: gmac

README.md

@@ -95,7 +95,7 @@ Requires an angle to be provided in radians. You may optionally specify the numb
 **Const.getRectForPointRing** `var result = Const.getRectForPointRing( [points] );`  
 Takes an array of `Point` objects; returns a `Rect` object of their bounding box.
 
-**Const.hitTestRect** `var result = Const.getRectForPointRing( pointP, rect );`  
+**Const.hitTestRect** `var result = Const.hitTestRect( pointP, rect );`  
 Takes target point P and a `Rect` object; returns `true` if the point falls within the rectangle.
 
 **Const.hitTestPointRing** `var result = Const.hitTestPointRing( pointP, [points, ...] );`  
@@ -274,4 +274,4 @@ In the above example, we have a node graph defined by data attributes with no co
 	var path = grid.findPath('sister', 'friend', weightFunct, estimateFunct);
 	// result array: ["sister" > "brother" > "friend"]
 
-The above process works by replacing Constellation's default *weight* and *estimate* functions. A weight function measures the accrued cost of each new grid segment, while the estimate function measures a best-case cost for reaching the goal. By default, Constellation uses its geometry `distance` function to measure the cost of grid segments. However, you're welcome to override this process and measure grid searches against custom meta data.
+The above process works by replacing Constellation's default *weight* and *estimate* functions. A weight function measures the accrued cost of each new grid segment, while the estimate function measures a best-case cost for reaching the goal. By default, Constellation uses its geometry `distance` function to measure the cost of grid segments. However, you're welcome to override this process and measure grid searches against custom meta data.