diff options
author | Campbell Barton <ideasman42@gmail.com> | 2012-05-21 01:23:26 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2012-05-21 01:23:26 +0400 |
commit | 3896ad4cbbd638956a072152baacd9c3554f913a (patch) | |
tree | cb37f3ab395969d694f6dfdf72d149436b6c0436 /source/blender/editors/mesh/editmesh_select.c | |
parent | deac41506fbba6040f89e578f0f4b8ba5c506bf8 (diff) |
code cleanup: spelling
Diffstat (limited to 'source/blender/editors/mesh/editmesh_select.c')
-rw-r--r-- | source/blender/editors/mesh/editmesh_select.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/editors/mesh/editmesh_select.c b/source/blender/editors/mesh/editmesh_select.c index 58e07b51a25..55f575bbdea 100644 --- a/source/blender/editors/mesh/editmesh_select.c +++ b/source/blender/editors/mesh/editmesh_select.c @@ -1270,7 +1270,7 @@ static int edgetag_shortest_path(Scene *scene, BMEditMesh *em, BMEdge *source, B * path found so far to edge n. The visitedhash will of course contain entries * for edges that have been visited, cost[n] will contain the length of the shortest * path to edge n found so far, Finally, heap is a priority heap which is built on the - * the same data as the cost arry, but inverted: it is a worklist of edges prioritized + * the same data as the cost array, but inverted: it is a worklist of edges prioritized * by the shortest path found so far to the edge. */ |