summaryrefslogtreecommitdiffhomepage
path: root/digital/avr
diff options
context:
space:
mode:
authorNicolas Schodet2012-05-28 23:16:47 +0200
committerNicolas Schodet2012-05-28 23:16:47 +0200
commit8c9e5fbd4ce3ac2d43182434c0ed8c646dab78c3 (patch)
treef8a69d008932148792984d2511c93e5a91675290 /digital/avr
parent385377602cc947eb945869ea4da7ab7af975939e (diff)
digital/avr/modules/path/astar: fix typo
Diffstat (limited to 'digital/avr')
-rw-r--r--digital/avr/modules/path/astar/astar.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/digital/avr/modules/path/astar/astar.c b/digital/avr/modules/path/astar/astar.c
index 4b2c816e..4b898a99 100644
--- a/digital/avr/modules/path/astar/astar.c
+++ b/digital/avr/modules/path/astar/astar.c
@@ -82,7 +82,7 @@ astar (struct astar_node_t *nodes, uint8_t nodes_nb, uint8_t initial,
if (nodes[neighbor].score == ASTAR_NODE_SCORE_CLOSED)
continue;
/* See if our lowest_node is better to arrive to this neighbor
- * node (node not considered yet, of new score is better). Note
+ * node (node not considered yet, or new score is better). Note
* that due to the score assigned to unvisited nodes, there is
* only one test. */
uint16_t tentative_score = lowest_score + neighbors[i].weight;