@@ -465,7 +465,7 @@ public SkeletonResult run(
465465 this .shortestPathPoints = new ArrayList [ this .numOfTrees ];
466466
467467 // Visit skeleton and measure distances.
468- // and apply warshall algorithm
468+ // and apply Warshall algorithm
469469 spStartPosition = new double [this .numOfTrees ][3 ];
470470 for (int i = 0 ; i < this .numOfTrees ; i ++)
471471 {
@@ -592,7 +592,7 @@ public SkeletonResult run(
592592 this .shortestPathPoints = new ArrayList [ this .numOfTrees ];
593593
594594 // Visit skeleton and measure distances.
595- // and apply warshall algorithm
595+ // and apply Warshall algorithm
596596 spStartPosition = new double [this .numOfTrees ][3 ];
597597 for (int i = 0 ; i < this .numOfTrees ; i ++)
598598 {
@@ -648,7 +648,7 @@ public ArrayList<Point>[] getShortestPathPoints()
648648 }
649649
650650 /**
651- * A simpler standalone running method, for analyzation without pruning
651+ * A simpler standalone running method, for analysis without pruning
652652 * or showing images.
653653 * <p>
654654 * This one just calls run(AnalyzeSkeleton_.NONE, false, null, true, false)
@@ -1239,7 +1239,7 @@ private void cutLowestIntensityBranch(
12391239 /**
12401240 * Display tag image on a new window.
12411241 *
1242- * @param taggedImage tag image to be diplayed
1242+ * @param taggedImage tag image to be displayed
12431243 */
12441244 void displayTagImage (ImageStack taggedImage )
12451245 {
0 commit comments