Class PathOrderAnalysisCmd

java.lang.Object
org.scijava.AbstractContextual
org.scijava.command.ContextCommand
sc.fiji.snt.analysis.TreeStatistics
sc.fiji.snt.plugin.PathOrderAnalysisCmd
All Implemented Interfaces:
Runnable, org.scijava.Cancelable, org.scijava.command.Command, org.scijava.Contextual, org.scijava.plugin.SciJavaPlugin

public class PathOrderAnalysisCmd extends TreeStatistics
Command to perform Path Ordering analysis on a Tree. Albeit related to reverse Horton-Strahler classification, Path ordering is formally distinct, as it classifies Paths rather than branches.
Author:
Tiago Ferreira
See Also:
  • Constructor Details

    • PathOrderAnalysisCmd

      public PathOrderAnalysisCmd(Tree tree)
  • Method Details

    • run

      public void run()
      Description copied from class: TreeStatistics
      Generates detailed summaries in which measurements are grouped by SWC-type flags
      Specified by:
      run in interface Runnable
      Overrides:
      run in class TreeStatistics
      See Also:
    • compute

      public void compute()
    • updateAndDisplayTable

      public void updateAndDisplayTable()
      Description copied from class: TreeStatistics
      Updates and displays the measurements table. If Context has not been set (running headless!?), table is printed to Console.
      Overrides:
      updateAndDisplayTable in class TreeStatistics
    • displayPlot

      public void displayPlot()
    • getCategoryChart

      public org.scijava.plot.CategoryChart getCategoryChart() throws IllegalArgumentException
      Returns the analysis chart.
      Returns:
      the analysis chart
      Throws:
      IllegalArgumentException - if tree contains multiple roots or loops
      See Also:
    • getChart

      public SNTChart getChart() throws IllegalArgumentException
      A variant of getCategoryChart() that returns the Analysis chart as a SNTChart object.
      Returns:
      the Strahler chart as a SNTChart object
      Throws:
      IllegalArgumentException - if tree contains multiple roots or loops
    • getCountMap

      public Map<Integer,Double> getCountMap()
      Returns:
      the map containing the number of paths on each order (order as key and counts as value). Single-point paths are ignored. An empty map will be returned if {compute() has not been called.
    • getBranchPointMap

      public Map<Integer,Double> getBranchPointMap()
      Returns:
      the map containing the number of branch points on each order (order as key and branch point count as value). Single-point paths are ignored. An empty map will be returned if {compute() has not been called.
    • getHighestPathOrder

      public int getHighestPathOrder()
      Description copied from class: TreeStatistics
      Gets the highest path order of the analyzed tree
      Overrides:
      getHighestPathOrder in class TreeStatistics
      Returns:
      the highest path order of the parsed tree.
      See Also:
    • getLengthMap

      public Map<Integer,Double> getLengthMap()
      Returns:
      the map containing the total path lengh on each order (order as key and sum length as value). Single-point paths are ignored. An empty map will be returned if {compute() has not been called.
    • getRatioMap

      public Map<Integer,Double> getRatioMap()
      Returns:
      the map containing th bifurcation ratios between orders (order as key and ratios as value). Single-point paths are ignored. An empty map will be returned if {compute() has not been called.