Run updates (#130)

* bug: fixed sorting issue and p_merged

* results updates

---------

Co-authored-by: anna-grim <[email protected]>

Author: anna-grim

src/segmentation_skeleton_metrics/skeleton_metric.py

@@ -683,8 +683,7 @@ def process_merge_sites(self):
 
             # Save results
             path = os.path.join(self.output_dir, "merge_sites.csv")
-            self.merge_sites.to_csv(path, index=True)
-            
+            self.merge_sites.to_csv(path, index=True)            
 
     def adjust_metrics(self, key):
         """
@@ -706,21 +705,24 @@ def adjust_metrics(self, key):
         """
         visited = set()
         for label in self.preexisting_merges:
-            label = self.label_handler.mapping[label]
-            if label in self.graphs[key].get_labels():
-                if label not in visited and label != 0:
-                    # Get component with label
-                    nodes = self.graphs[key].nodes_with_label(label)
-                    root = util.sample_once(list(nodes))
-
-                    # Adjust metrics
-                    rl = self.graphs[key].run_length_from(root)
-                    self.graphs[key].run_length -= np.sum(rl)
-                    self.graphs[key].graph["n_edges"] -= len(nodes) - 1
-
-                    # Update graph
-                    self.graphs[key].remove_nodes_from(nodes)
-                    visited.add(label)
+            try:
+                label = self.label_handler.mapping[label]
+                if label in self.graphs[key].get_labels():
+                    if label not in visited and label != 0:
+                        # Get component with label
+                        nodes = self.graphs[key].nodes_with_label(label)
+                        root = util.sample_once(list(nodes))
+
+                        # Adjust metrics
+                        rl = self.graphs[key].run_length_from(root)
+                        self.graphs[key].run_length -= np.sum(rl)
+                        self.graphs[key].graph["n_edges"] -= len(nodes) - 1
+
+                        # Update graph
+                        self.graphs[key].remove_nodes_from(nodes)
+                        visited.add(label)
+            except:
+                pass
 
     def find_label_intersections(self):
         """
@@ -794,7 +796,8 @@ def quantify_merges(self):
 
         """
         for key in self.graphs:
-            p = self.n_merged_edges[key] / self.graphs[key].graph["n_edges"]
+            n_edges = max(self.graphs[key].graph["n_edges"], 1)
+            p = self.n_merged_edges[key] / n_edges
             self.metrics.loc[key, "% Merged"] = round(100 * p, 2)
 
     # -- Compute Metrics --