Uses of Class
sc.fiji.snt.analysis.graph.DirectedWeightedGraph
Packages that use DirectedWeightedGraph
Package
Description
SNT core classes
Analysis of
Trees.Classes for handling neuronal reconstructions as graphs
Classes handling neuropil annotations and atlases metadata.
Automatic neuron tracing algorithms that reconstruct complete neuronal
morphologies from images without user interaction.
Storage backends for the Gray-Weighted Distance Transform (GWDT) tracing
algorithm.
Classes implementing SNT's Graph Viewer
-
Uses of DirectedWeightedGraph in sc.fiji.snt
Methods in sc.fiji.snt that return DirectedWeightedGraphModifier and TypeMethodDescriptionTree.getGraph()Assembles a DirectedGraph from this Tree.Tree.getGraph(boolean simplify) Assembles a DirectedGraph from this Tree.Methods in sc.fiji.snt with parameters of type DirectedWeightedGraphModifier and TypeMethodDescriptionstatic PathAndFillManagerPathAndFillManager.createFromGraph(DirectedWeightedGraph graph, boolean keepTreePathStructure) Create a new PathAndFillManager instance from the graph.protected voidPathAndFillManager.importGraph(DirectedWeightedGraph graph) protected voidPathAndFillManager.importGraphWithPathStructure(DirectedWeightedGraph graph) voidSNTService.loadGraph(DirectedWeightedGraph graph) Constructors in sc.fiji.snt with parameters of type DirectedWeightedGraphModifierConstructorDescriptionTree(DirectedWeightedGraph graph, String label) Instantiates a new Tree from a DirectedWeightedGraph with the specified label.Tree(DirectedWeightedGraph graph, String label, boolean keepTreePathStructure) Instantiates a new Tree from a DirectedWeightedGraph with control over path structure preservation. -
Uses of DirectedWeightedGraph in sc.fiji.snt.analysis
Methods in sc.fiji.snt.analysis that return DirectedWeightedGraphMethods in sc.fiji.snt.analysis with parameters of type DirectedWeightedGraphModifier and TypeMethodDescriptionstatic voidStrahlerAnalyzer.classify(DirectedWeightedGraph graph, boolean reverseOrder) protected static Map<BrainAnnotation, Double> TreeStatistics.getAnnotatedLength(DirectedWeightedGraph graph, int level, char lr, boolean norm) protected static Map<BrainAnnotation, double[]> TreeStatistics.getAnnotatedLengthsByHemisphere(DirectedWeightedGraph graph, int level, boolean norm) -
Uses of DirectedWeightedGraph in sc.fiji.snt.analysis.graph
Subclasses of DirectedWeightedGraph in sc.fiji.snt.analysis.graphModifier and TypeClassDescriptionclassMemory-efficient variant ofDirectedWeightedGraphbacked by a compressed sparse-row (CSR) adjacency representation (CsrDirectedSpecifics).Methods in sc.fiji.snt.analysis.graph that return DirectedWeightedGraphModifier and TypeMethodDescriptionstatic DirectedWeightedGraphGraphUtils.createGraph(Collection<SWCPoint> nodes, boolean assignDistancesToWeights) Deprecated.static DirectedWeightedGraphGraphUtils.createGraph(Tree tree) Deprecated.DirectedWeightedGraph.getSimplifiedGraph()Returns a simplified graph in which slab nodes are removed and the graph is represented only by root, branch nodes and leaves.static DirectedWeightedGraphGraphUtils.getSimplifiedGraph(DirectedWeightedGraph graph) Deprecated.Methods in sc.fiji.snt.analysis.graph that return types with arguments of type DirectedWeightedGraphModifier and TypeMethodDescriptionDirectedWeightedGraph.getComponents()Return the connected components of this graph as a list of newDirectedWeightedGraphs.Methods in sc.fiji.snt.analysis.graph with parameters of type DirectedWeightedGraphModifier and TypeMethodDescriptionstatic DirectedWeightedGraphGraphUtils.getSimplifiedGraph(DirectedWeightedGraph graph) Deprecated.static WindowGraphUtils.show(DirectedWeightedGraph graph) Displays a graph in SNT's "Dendrogram Viewer" featuring UI commands for interactive visualization and export options.Constructors in sc.fiji.snt.analysis.graph with parameters of type DirectedWeightedGraphModifierConstructorDescriptionprotectedDirectedWeightedSubgraph(DirectedWeightedGraph graph, Set<SWCPoint> nodeSubset) Creates a subgraph from a sub-set of nodes. -
Uses of DirectedWeightedGraph in sc.fiji.snt.annotation
Methods in sc.fiji.snt.annotation with parameters of type DirectedWeightedGraphModifier and TypeMethodDescriptionstatic voidAllenUtils.assignHemisphereTags(DirectedWeightedGraph graph) Assigns hemisphere tags to all nodes in a graph.static List<DirectedWeightedSubgraph> AllenUtils.splitByHemisphere(DirectedWeightedGraph graph) -
Uses of DirectedWeightedGraph in sc.fiji.snt.tracing.auto
Methods in sc.fiji.snt.tracing.auto that return DirectedWeightedGraphModifier and TypeMethodDescriptionBinaryTracer.getSingleGraph()Generates a singleDirectedWeightedGraphs by combiningBinaryTracer.getGraphs()'s list into a single, combined graph.abstract DirectedWeightedGraphAbstractAutoTracer.traceToGraph()Traces the structure and returns a DirectedWeightedGraph.AbstractGWDTTracer.traceToGraph()Methods in sc.fiji.snt.tracing.auto that return types with arguments of type DirectedWeightedGraphModifier and TypeMethodDescriptionBinaryTracer.getGraphs()Generates a list ofDirectedWeightedGraphs from the skeleton image.Methods in sc.fiji.snt.tracing.auto with parameters of type DirectedWeightedGraphModifier and TypeMethodDescriptionprotected voidAbstractAutoTracer.collapseSomaNodes(DirectedWeightedGraph graph, double cx, double cy, double cz) Core method to collapse soma nodes to a centroid.protected voidAbstractAutoTracer.collapseSomaToRoiCentroid(DirectedWeightedGraph graph) Collapses all soma nodes to the geometric ROI centroid.protected voidAbstractAutoTracer.collapseSomaToWeightedCentroid(DirectedWeightedGraph graph) Collapses all soma nodes to their weighted centroid.protected voidAbstractGWDTTracer.computeAndApplyScoreMap(DirectedWeightedGraph graph) Computes or applies a score map and stamps each graph node'sPointInImage.vwith its score.protected voidAbstractGWDTTracer.darkNodeAndSegmentPruning(DirectedWeightedGraph graph, double effectiveThreshold) APP2-style dark node and segment pruning.intComponentReconnector.extendTips(DirectedWeightedGraph graph, SWCPoint root, double backgroundThreshold) Extends leaf tips of the tree across multi-voxel gaps by scanning for bright signal in each leaf's tangent direction and A*-bridging to it.protected SWCPointAbstractAutoTracer.findGraphRoot(DirectedWeightedGraph graph) Finds the root node of a graph.protected voidAbstractGWDTTracer.hierarchicalPrune(DirectedWeightedGraph graph, double effectiveThreshold) Performs hierarchical pruning using intensity-weighted coverage.protected voidAbstractGWDTTracer.pruneParallelBranches(DirectedWeightedGraph graph) Prunes parallel sibling branches, i.e., pairs of terminal branches that fork from the same branch point and then run alongside each other (their nodes stay within a radius-dependent proximity threshold).protected voidAbstractGWDTTracer.recalculateRadiiFromImage(DirectedWeightedGraph graph, double effectiveThreshold) Recalculates radii for all nodes using image-based method (like APP2).intComponentReconnector.reconnect(DirectedWeightedGraph graph, SWCPoint root, double backgroundThreshold) Attempts to reconnect disconnected components in the graph back to the main tree (the component containing the root).protected voidAbstractAutoTracer.removeDisconnectedComponents(DirectedWeightedGraph graph) Removes all vertices not connected to the root.protected voidAbstractGWDTTracer.removeOvershoots(DirectedWeightedGraph graph) Removes overshoot artifacts from the graph.protected voidAbstractGWDTTracer.removeZigzags(DirectedWeightedGraph graph) Removes zigzag artifacts from the graph.protected voidAbstractGWDTTracer.resampleCurve(DirectedWeightedGraph graph, double stepSize) Resamples the curve to have evenly spaced points.protected voidAbstractGWDTTracer.smoothCurve(DirectedWeightedGraph graph, int windowSize) Smooths the final curve using a moving average filter.AbstractAutoTracer.splitAtSomaBoundary(DirectedWeightedGraph graph) Splits a graph at the soma boundary, creating separate trees for each neurite.protected voidAbstractGWDTTracer.tuneBranches(DirectedWeightedGraph graph, double cosThreshold) Tunes branch-point topology by re-parenting nodes adjacent to bifurcations. -
Uses of DirectedWeightedGraph in sc.fiji.snt.tracing.auto.gwdt
Methods in sc.fiji.snt.tracing.auto.gwdt that return DirectedWeightedGraphModifier and TypeMethodDescriptionArrayStorageBackend.buildGraph(long[] dims, double[] spacing, double threshold) DiskBackedStorageBackend.buildGraph(long[] dims, double[] spacing, double threshold) SparseStorageBackend.buildGraph(long[] dims, double[] spacing, double threshold) StorageBackend.buildGraph(long[] dims, double[] spacing, double threshold) Build graph from computed Fast Marching data. -
Uses of DirectedWeightedGraph in sc.fiji.snt.viewer.geditor
Constructors in sc.fiji.snt.viewer.geditor with parameters of type DirectedWeightedGraphModifierConstructorDescriptionprotectedTreeGraphAdapter(DirectedWeightedGraph graph, String verticesColor)