Merge pull request #42 from jdeniau/patch-1

Syntax higlighting

Author: bgrins

README.md

@@ -7,41 +7,39 @@ See a demo at http://www.briangrinstead.com/files/astar/
 ## Sample Usage
 
 If you want just the A* search code (not the demo visualization), use code like this http://gist.github.com/581352
-
-<script type='text/javascript' src='astar.js'></script>
-<script type='text/javascript'>
-var graph = new Graph([
-[1,1,1,1],
-[0,1,1,0],
-[0,0,1,1]
-]);
-var start = graph.grid[0][0];
-var end = graph.grid[1][2];
-var result = astar.search(graph, start, end);
-// result is an array containing the shortest path
-
-var graphDiagonal = new Graph([
-[1,1,1,1],
-[0,1,1,0],
-[0,0,1,1]
-], { diagonal: true });
-var start = graphDiagonal.grid[0][0];
-var end = graphDiagonal.grid[1][2];
-var resultWithDiagonals = astar.search(graphDiagonal, start, end, { heuristic: astar.heuristics.diagonal });
-
-// Weight can easily be added by increasing the values within the graph, and where 0 is infinite (a wall)
-var graphWithWeight = new Graph([
-[1,1,2,30],
-[0,4,1.3,0],
-[0,0,5,1]
-]);
-var startWithWeight = graphWithWeight.grid[0][0];
-var endWithWeight = graphWithWeight.grid[1][2];
-var resultWithWeight = astar.search(graphWithWeight, startWithWeight, endWithWeight);
-
-// resultWithWeight is an array containing the shortest path taking into account the weight of a node
-</script>
-
+```js
+<script type='text/javascript' src='astar.js'></script>
+<script type='text/javascript'>
+var graph = new Graph([
+[1,1,1,1],
+[0,1,1,0],
+[0,0,1,1]
+]);
+var start = graph.grid[0][0];
+var end = graph.grid[1][2];
+var result = astar.search(graph, start, end);
+// result is an array containing the shortest path
+var graphDiagonal = new Graph([
+[1,1,1,1],
+[0,1,1,0],
+[0,0,1,1]
+], { diagonal: true });
+
+var start = graphDiagonal.grid[0][0];
+var end = graphDiagonal.grid[1][2];
+var resultWithDiagonals = astar.search(graphDiagonal, start, end, { heuristic: astar.heuristics.diagonal });
+// Weight can easily be added by increasing the values within the graph, and where 0 is infinite (a wall)
+var graphWithWeight = new Graph([
+[1,1,2,30],
+[0,4,1.3,0],
+[0,0,5,1]
+]);
+var startWithWeight = graphWithWeight.grid[0][0];
+var endWithWeight = graphWithWeight.grid[1][2];
+var resultWithWeight = astar.search(graphWithWeight, startWithWeight, endWithWeight);
+// resultWithWeight is an array containing the shortest path taking into account the weight of a node
+</script>
+```
 A few notes about weight values:
 
 1. A weight of 0 denotes a wall.