Corrected **** in README

pablogsal · pablogsal · commit ee4c325b5c03 · 2016-06-28T19:31:35.000+02:00
diff --git a/README.md b/README.md
@@ -193,4 +193,4 @@ I think the deep logic about A* can be sumarized in the following two simple poi
 
 * We artificially alter the cost of visiting one node taking into account how far this particular node is from the destination, making the furthest nodes more costly.
 
-And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but ** is NOT the A* algorithm ** : it is secondary logic and secondary problems that lead to secondary data structures.
+And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but **is NOT** the A* algorithm: it is secondary logic and secondary problems that lead to secondary data structures.

Original file line number	Diff line number	Diff line change
`@@ -193,4 +193,4 @@ I think the deep logic about A* can be sumarized in the following two simple poi`
`193`	`193`
`194`	`194`	`* We artificially alter the cost of visiting one node taking into account how far this particular node is from the destination, making the furthest nodes more costly.`
`195`	`195`
`196`		`-And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but ** is NOT the A* algorithm ** : it is secondary logic and secondary problems that lead to secondary data structures.`
	`196`	`+And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but is NOT the A* algorithm: it is secondary logic and secondary problems that lead to secondary data structures.`